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>

int chksame(char *S,char *T,int len){
    for(int i=0;i<len;i++){
        if(S[i]!=T[i]){

            return -1;
        }
    }
    return 1;
}


int main(void){
    char S[100]={};
    char T[100]={};
    scanf("%s",S);
    scanf("%s",T);
    int len=0;
    while(S[len]!='\0'){
        len++;
    }
    for(int i=0;i<len;i++){
        char temp = S[0];
        for(int j=0;j<len-1;j++){
            S[j]=S[j+1];
        }
        S[len-1]=temp;
        if(chksame(S,T,len)==1){
            printf("Yes\n");
            return 0;
        }
    }
    printf("No\n");
    return 0;
}