102570: [AtCoder]ABC257 A - A to Z String 2

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.

Sample Input 1

1 3

Sample Output 1

C

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

Sample Input 2

2 12

Sample Output 2

F

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

问题描述

将这些字符按顺序连接起来：$N$个A's，$N$个B's，……，$N$个Z's。然后找出从连接后的字符串开始的第$X$个字符。

约束

• $1 \leq N \leq 100$
• $1 \leq X \leq N\times 26$
• 输入中的所有值都是整数。

输入

标准输入给出以下格式的输入：

$N$ $X$

输出

打印答案。

样例输入 1

1 3

样例输出 1

C

我们得到字符串ABCDEFGHIJKLMNOPQRSTUVWXYZ，从开始的第3个字符是C。

样例输入 2

2 12

样例输出 2

F

我们得到字符串AABBCCDDEEFFGGHHIIJJKKLLMMNNOOPPQQRRSSTTUUVVWWXXYYZZ，从开始的第12个字符是F。