function solution(k, dungeons) {
const listLength = dungeons.length;
const visited = Array(listLength).fill(false);
let maxCount = 0;
function maxVisit(currentK, count){
for(let i = 0; i < listLength; i++){
if(!visited[i] && currentK >= dungeons[i][0]){
visited[i] = true;
maxVisit(currentK - dungeons[i][1], count + 1);
visited[i] = false;
}
}
maxCount = Math.max(maxCount, count);
return;
};
maxVisit(k, 0);
return maxCount;
}