{"problem":{"name":"A to Z String 2","description":{"content":"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.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc257_a"},"statements":[{"statement_type":"Markdown","content":"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.\n\n## Constraints\n\n*   $1 \\leq N \\leq 100$\n*   $1 \\leq X \\leq N\\times 26$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $X$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc257_a","tags":[],"sample_group":[["1 3","C\n\nWe obtain the string `ABCDEFGHIJKLMNOPQRSTUVWXYZ`, whose $3$\\-rd character from the beginning is `C`."],["2 12","F\n\nWe obtain the string `AABBCCDDEEFFGGHHIIJJKKLLMMNNOOPPQQRRSSTTUUVVWWXXYYZZ`, whose $12$\\-th character from the beginning is `F`."]],"created_at":"2026-03-03 11:01:14"}}