Problem:
Score : 200 points

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
tokyo

Sample Output 1

Yes

In the first operation, kyoto becomes okyot.

In the second operation, okyot becomes tokyo.

Sample Input 2

abc
arc

Sample Output 2

No

abc does not equal arc after any number of operations.

Sample Input 3

aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab

Sample Output 3

Yes

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String a = sc.next();
        String b = sc.next();
        char[] s = a.toCharArray();
        char[] t = b.toCharArray();
        char[] s2 =a.toCharArray();
        int cnt = 0;
        int cnt2 =0;
        //System.out.println(a.length());

        while(cnt<a.length()){
            for(int i =0;i<a.length();i++){
                if(i==a.length()-1){
                    s2[0]=s[i];
                }else{
                    s2[i+1]=s[i];
                }

            }
            //System.out.println(s2);
            if(Arrays.equals(t,s2)){
                cnt2++;
            }
            s=s2.clone();
            cnt++;
        }

        if(cnt2>0){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }
    }
}