const array = [
  [1, 2, 3],
  [2, 2, 3],
  [3, 3, 3],
];

function solution(n, left, right) {
  let answer = [];
  let start = Math.floor(left / n);
  let end = Math.floor(right / n);

  let count = start * n;
  for (let i = start; i <= end; i += 1) {
    let fillNum = i + 1;
    for (let j = 0; j < n; j += 1) {
      if (j > i) {
        fillNum += 1;
      }
      count += 1;
      if (left < count && count <= right + 1) {
        answer.push(fillNum);
      } else if (count > right + 1) {
        break;
      }
    }
  }
  return answer;
}

function solution(n, left, right) {
  let answer = [];
  for (let i = left; i <= right; i++) {
    const row = Math.floor(i / n);
    const col = i % n;
    const maxInRow = Math.max(row, col);
    answer.push(maxInRow + 1);
  }
  return answer;
}