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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
int main()
{   char s1[101],s2[101];
	int i,n1,j,n,flag,g;
	scanf("%s%s",s1,s2);
	n=strlen(s1);
	n1=strlen(s2);
	if(n!=n1)
	  {printf("NO\n");return 0;}
	for(j=0;j<n;j++)
	{
	g=s1[0];flag=0;
	 for(i=0;i<n-1;i++)
	    s1[i]=s1[i+1];
	 s1[n-1]=g;
	 for(i=0;i<n;i++)
		if(s1[i]==s2[i])
		   flag++;
	 if(flag==n)break;  
	 }
	if(flag==n)
		printf("YES\n");
	else 
		printf("NO\n");
	
}