当前没有测试数据。

A - A to Z String 2

Score : $100$ points

Problem Statement

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.

Constraints

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

Input

Input is given from Standard Input in the following format:

$N$ $X$

Output

Print the answer.

1 3

C

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

2 12

F

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