{"problem":{"name":"Caesar Cipher","description":{"content":"Takahashi has a string $S$ consisting of lowercase English letters. On this string, he will do the operation below just once. *   First, choose a non-negative integer $K$. *   Then, shift each charac","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc232_b"},"statements":[{"statement_type":"Markdown","content":"Takahashi has a string $S$ consisting of lowercase English letters.\nOn this string, he will do the operation below just once.\n\n*   First, choose a non-negative integer $K$.\n*   Then, shift each character of $S$ to the right by $K$ (see below).\n\nHere,\n\n*   `a` shifted to the right by $1$ is `b`;\n*   `b` shifted to the right by $1$ is `c`;\n*   `c` shifted to the right by $1$ is `d`;\n*   $\\cdots$\n*   `y` shifted to the right by $1$ is `z`;\n*   **`z` shifted to the right by $1$ is `a`.**\n\nFor example, `b` shifted to the right by $4$ is `f`, and `y` shifted to the right by $3$ is `b`.\nYou are given a string $T$. Determine whether Takahashi can make $S$ equal $T$ by the operation above.\n\n## Constraints\n\n*   Each of $S$ and $T$ is a string of length between $1$ and $10^5$ (inclusive) consisting of lowercase English letters.\n*   The lengths of $S$ and $T$ are equal.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n$T$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc232_b","tags":[],"sample_group":[["abc\nijk","Yes\n\nWhen Takahashi chooses $K=8$,\n\n*   `a` is shifted to the right by $8$ and becomes `i`,\n*   `b` is shifted to the right by $8$ and becomes `j`,\n*   `c` is shifted to the right by $8$ and becomes `k`,\n\nand now $S$ and $T$ are equal.  \nTherefore, he can make $S$ equal $T$, so `Yes` should be printed."],["z\na","Yes\n\nChoosing $K=1$ makes $S$ and $T$ equal.  \nNote that the letter on the right of `z` is `a`."],["ppq\nqqp","No\n\nThere is no non-negative integer $K$ that he can choose to make $S$ equal $T$, so `No` should be printed."],["atcoder\natcoder","Yes\n\nChoosing $K=0$ makes $S$ and $T$ equal."]],"created_at":"2026-03-03 11:01:14"}}