#abc257a. [abc257_a]A to Z String 2

[abc257_a]A to Z String 2

Problem Statement

Find the XX-th character from the beginning of the string that is obtained by concatenating these characters: NN copies of A's, NN copies of B's, …, and NN copies of Z's, in this order.

Constraints

  • 1leqNleq1001 \\leq N \\leq 100
  • 1leqXleqNtimes261 \\leq X \\leq N\\times 26
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

NN XX

Output

Print the answer.


Sample Input 1

1 3

Sample Output 1

C

We obtain the string ABCDEFGHIJKLMNOPQRSTUVWXYZ, whose 33-rd character from the beginning is C.


Sample Input 2

2 12

Sample Output 2

F

We obtain the string AABBCCDDEEFFGGHHIIJJKKLLMMNNOOPPQQRRSSTTUUVVWWXXYYZZ, whose 1212-th character from the beginning is F.