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>
void ope(char *p,int ln){
    int i;
    char lol = p[ln-1];
    for(i=ln-1;i>0;i--){
    p[i] = p[i-1];
    }
    p[0]=lol;
    p[ln]='\0';

}
/*void reverse(char *p,int ln){
    int i=0,j=ln-1;
    char lol;
    for(i=0,j=ln-1;j>i;i++,j--){
    //	printf("%c\n",p[i]);
    lol=p[i];
    p[i]=p[j];
    p[j]=lol;
  //  printf("%d\t%c\n",j,p[j]);
    }
    p[ln]='\0';

}*/
int main(){
	int i;
    char s[110];
    char t[110];
    gets(s);
    gets(t);
    int ln=strlen(t);
    //printf("%s\n",s);
    	//i=strcmp(s,t);
    //	printf("%d\n",i);
    //reverse(t,ln);
    //printf("%s\n",t);
    //int i;
    
    if(strcmp(s,t)==0){
    
    printf("Yes\n");
    return 0;
    }
    else{
    for(i=0;i<ln;i++){
    ope(s,ln);
    //printf("%s\n",t);
    if(strcmp(s,t)==0){
        printf("Yes\n");
        return 0;
    }

    }
    printf("No\n");

    }



    return 0;
    }