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()
{
  int a,b,c,i,j;
    char ch[100000];
    char fh[100000];
    gets(ch);
    gets(fh);
    char t;
    a=strlen(ch);
    b=strlen(fh);
    for(i=0;i<a;i++)
    {
        for(j=i+1;j<a;j++)
        {
            if(ch[i]>ch[j])
            {
                t=ch[i];
                ch[i]=ch[j];
                ch[j]=t;
                
            }
            
        }
    }
    for(i=0;i<b;i++)
    {
        for(j=i+1;j<b;j++)
        {
            if(fh[i]>fh[j])
            {
                t=fh[i];
                fh[i]=fh[j];
                fh[j]=t;
                
            }
            
        }
    }
    int y;
    y=strcmp(ch,fh);
    if(y==0)
    {
        printf("YES\n");
    }
    else
    {
        printf("NO\n");
    }
    
    
}