function solution(n, t, m, p) {
  // n : 진법
  // t : 갯수
  // m : 인원
  // p : 순서
  let i = 0;
  let store = [];
  let answer = "";
  let cnt = 0;
  let target;
  while (t > 0) {
    store.push(...i.toString(n).split(""));
    if (answer == "" && store.length >= p) {
      answer += store[p - 1] + "";
      t--;
      cnt++;
    }
    target = p + m * cnt;
    if (store.length >= target) {
      answer += store[target - 1] + "";
      t--;
      cnt++;
    }

    i++;
  }

  answer = answer.replace(/[a-z]/g, (s) => s.toUpperCase());
  return answer;
}

function solution(n, t, m, p) {
  var tubeT = Array.apply(null, Array(t)).map((a, i) => i * m + p - 1);
  var line = "";
  var max = m * t + p;
  for (var i = 0; line.length <= max; i++) {
    line += i.toString(n);
  }
  return tubeT
    .map((a) => line[a])
    .join("")
    .toUpperCase();
}