Problem2352--A to Z String 2

2352: A to Z String 2

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

SubmitSolved: 18Submit Num: 23Statistics

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 100100 points

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

  • 1 \leq N \leq 1001≤N≤100
  • 1 \leq X \leq N\times 261≤X≤N×26
  • All values in input are integers.

Input

Input is given from Standard Input in the following format: 
NNXX

Output

Print the answer.

Input



Output



Sample Input Copy 

2 12

Sample Output Copy 

F

HINT

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

Source/Category

AtCoder 
Submit