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 hantei(char A[],char B[]){
    for(int i = 0;i < strlen(A);i++){
        if(A[i] != B[i]) return 0;
    }
    return 1;
}

void rot(char A[]){
    char keep;
    keep = A[0];
    for(int i = 0;i < strlen(A)-1;i++){
        A[i] = A[i+1];
    }
    A[strlen(A)-1] = keep;
}

int main(){
    char S[100],T[100];
    scanf("%s%s",S,T);
    int len = strlen(S);
    for(int i = 0;i < len;i++){
        if(hantei(S,T) == 1){
            printf("Yes\n");
            return 0;
        }
        rot(S);
    }
    printf("No\n");
    return 0;
}