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: Runtime Error)

#include <stdio.h>
#include <string.h>
#define N 100
char*change(char *x,int max)
{
  int i;
  char *s;
  s[0]=x[max-1];
  for(i=0;i<max-1;i++){
    s[i+1]=x[i];
  }
  return *s;
}
 
int main(void)
{
  int i,j,max;
  char *s,*t;
  for(i=0;i<N;i++){
    scanf("%s",s[i]);
    if(s[i]==NULL){
      max=i;
    break;
    }
  }
  for(i=0;i<max+1;i++){
    scanf("%s",t[i]);
  }
  for(i=0;i<max+1;i++){
    s=change(s,max);
    t=change(t,max+1);
  	for(j=0;j<max;j++){
    	if(s[j]!=t[j]){
      		break;
    	}
      	if(i==max-1){
          printf("Yes");
          return 0;
        }
     }
  }
  printf("No");
  return 0;
}