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[106],b[106];
    scanf("%s",a);
    scanf("%s",b);
    int i,l1,l2,c=0;
    l1=strlen(a);
    a[0]=a[l1-1];
    for(i=1;i<l1-1;i++)
    {
        a[i]=a[i+1];
    }
    
    for(i=0;i<l1;i++)
    {
        if(a[l1-i-1]==b[i])
            c++;
    }
    if(c==l1)
        printf("YES");
    if(c!=l1)
        printf("NO");
    
    return 0;
        
}