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

#include <stdio.h>
#include<string.h>

int main()
{
	char a[1001],b[1001],m[1001];
	int c,d,i,j,p,x=1;

	gets(a);
	gets(b);
	c=strlen(a);
/*	if(strcmp(a,b)==0)
    {
        printf("Yes\n");
        goto A;
    }
*/
    for(i=0;i<c;i++)
    {
        if(a[0] == b[i])
        {
            p=i;
        }
    }


    for(i=p,j=0;j<(c-p);i++,j++)
    {
        if(a[j] != b[i])
        {
            x=0;
            break;
        }

    }
    /*for(i=(c-p),j=0;j<c;i++,j++)
    {
        m[j]=a[i];
        if(i==(c))
        {
            i=-1;
        }
    }
    m[j]='\0';

*/
   // printf("%s\n",m);
    if(x){
        printf("Yes\n");
    }
    else
    {
        printf("No\n");
    }



    return 0;
}