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 (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>
char b[100];
int rotate(char a[], char c[])
{
    int i,j,len=strlen(a);
    int k=0;
    for(k; k<len; k++)
    {
        *b=a[len-1-k];
        for(i=len-k,j=1; j<len; i++,j++)
        {
            if(i>=len)
                i=0;
            *(b+j)=a[i];

        }
        *(b+j)='\0';
        int l=0;
        if(strcmp(c,b)==0)
        {
            return 1;
        }
    }
    return 0;
}
int main()
{
    char p[100], q[100];
    scanf("%s %s",p,q);
    if(rotate(p,q))
        printf("Yes\n");
    else
        printf("No\n");
    return 0;

}