Problem9617--ABC257 —— A - A to Z String 2

9617: ABC257 —— A - A to Z String 2

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

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

Input

Input is given from Standard Input in the following format:

```
$N$ $X$
```

Output

Print the answer.

Constraints

-   $1 \leq N \leq 100$
-   $1 \leq X \leq N\times 26$
-   All values in input are integers.

Sample 1 Input

1 3

Sample 1 Output

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

Sample 2 Input

2 12

Sample 2 Output

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

Source/Category