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>
 
int main(void)
{
  int i = 0,len = 0,j,k=0,l=0;

  char S[100];
  char T[100];
  char U[100];
  
  scanf("%s",S);
  scanf("%s",T);

  while(S[len]){
  	len++;
  }
  
  while(l<len){

	U[0] = S[len-1];
	for(j=1;j<len;j++){
		U[j]=S[j-1];
	}
	for(j=0;j<len;j++){
		S[j]=U[j];
	}
	while(U[k] == T[k] || U[k] == '\0'){
		k++;
	}
	if(k-1==len){
		i = 1;
		break;
	}
		k=0;
		l++;
	}
	if(i == 0)
		printf("No\n");
	else
		printf("Yes\n");
  
  return 0;
}