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>

int main()
{
    int i,j,l1,f=0;
    char s[105],t[105],s2[105];
    gets(s);
    gets(t);
    l1=strlen(s);
    for(j=0; j<=l1; j++)
    {

        for(i=1; s[i]!='\0'; i++)
        {
            s2[0]=s[l1-1];
            s2[i]=s[i-1];
        }
       // printf("%s\n",s2);
        for(i=0;i<l1;i++)
        {
            s[i]=s2[i];
        }
       // s[l1]='\0';
        if(strcmp(s,t)==0)
        {
            f=1;
            break;
        }
    }
    if(f==1) printf("Yes\n");
    else printf("No\n");
    return 0;
}