Write and Erase AtCoder - 3530 JAVA

String Rotation

 AtCoder - 4171 

Problem Statement

 

You are given string S and T consisting of lowercase English letters.

Determine if S equals T after rotation.

That is, determine if S equals T after the following operation is performed some number of times:

Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.

Here, |X| denotes the length of the string X.

Constraints

 

• 2 \leq |S| \leq 100
• |S| = |T|
• S and T consist of lowercase English letters.

Input

 

Input is given from Standard Input in the following format:

S
T

Output

 

If S equals T after rotation, print Yes; if it does not, print No.

Sample Input 1

 

kyoto
t