{"raw_statement":[{"iden":"problem statement","content":"You are given string $S$ and $T$ consisting of lowercase English letters.\nDetermine if $S$ equals $T$ after _rotation_.\nThat is, determine if $S$ equals $T$ after the following operation is performed some number of times:\nOperation: Let $S = S_1 S_2 ... S_{|S|}$. Change $S$ to $S_{|S|} S_1 S_2 ... S_{|S|-1}$.\nHere, $|X|$ denotes the length of the string $X$."},{"iden":"constraints","content":"*   $2 \\leq |S| \\leq 100$\n*   $|S| = |T|$\n*   $S$ and $T$ consist of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$T$"},{"iden":"sample input 1","content":"kyoto\ntokyo"},{"iden":"sample output 1","content":"Yes\n\n*   In the first operation, `kyoto` becomes `okyot`.\n*   In the second operation, `okyot` becomes `tokyo`."},{"iden":"sample input 2","content":"abc\narc"},{"iden":"sample output 2","content":"No\n\n`abc` does not equal `arc` after any number of operations."},{"iden":"sample input 3","content":"aaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab"},{"iden":"sample output 3","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}