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 str1[100],str2[1000],str3[100];
    int l1,l2;
    scanf("%s%s",str1,str2);
    l1=strlen(str1);
    l2=strlen(str2);
    if(l1!=l2)
    {
        printf("No\n");
    }
    else
        {
        for(int k=0;k<l1;k++)
        {
            str3[0]=str1[l1];

        for(int i=0;i<(l1-1);i++)
        {

            str3[i+1]=str1[i];

        }
            for(int j=0;j<l1;j++)
            {
                if(str2[j]==str3[j])
                {
                    printf("Yes\n");
                    return 0;
                }
            }
               for(int l=0;l<l1;l++)
               {
                   str1[l]=str3[l];
               }

        }
        printf("No\n");
        }
        return 0;
}