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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Linq;
using System.Collections.Generic;

public class Test
{
	public static void Main()
	{
        string line = Console.ReadLine();
        string target = Console.ReadLine();
        string s = "";
        bool can = false;

        for(int i = 0 ; i < line.Length ; i++){
            if(line == target){
                can = true;
            }
            s = line[line.Length-1].ToString();
            line = s + line;
            line = line.Remove(line.Length-1, 1);
        }
        
        if(can){
            Console.WriteLine("Yes");
        } else {
            Console.WriteLine("No");
        }
    }                                                                                                                                   
}