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: Wrong Answer)

import java.util.*;

public class Main {
	public static void main (String[] args) {
	    Scanner sc = new Scanner(System.in);
	    String s,t;
	    int j = -1,k = 0,l = 0;
	    s = sc.nextLine();
	    t = sc.nextLine();
	    for(int i = 0;i < t.length();i++)
	    if(s.charAt(0) == t.charAt(i))
	    {
	    j = i;
	    break;
	    }
	    if(j == -1)
	    System.out.println("No");
	    else
	    {
	        for(int i = j;;i++)
	        {
	            if(k == s.length())
	            break;
	            if(i == t.length())
	            i = 0;
	        if(s.charAt(k) == t.charAt(i))
	        l++;
	        else
	        break;
	        k++;
	        }
	        if(l == s.length())
	        System.out.println("Yes");
	        else
	        System.out.println("No");
	    }
	}
}