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: Accepted)

#include <stdio.h>
#include <string.h>

int main(void)
{
  char in[100]={};
  char ans[100]={};
  char rot[100]={};
  int match = 0;
  int len=0;
  int i=0;
  int j=0;
  int idx=0;
  scanf("%s",in); 
  scanf("%s",ans); 
  len = strlen(in);
  
#if 0
  printf("%s\n",in);
  printf("%s\n",ans);
  printf("%d\n",len);
#endif
  for(i=0;i<len;i++)
  {
    for(j=0;j<len;j++)
    {
       idx = i+j;
       if (idx >= len ) idx -= len;
       rot[idx] = in[j]; 
    }
    rot[len] = '\0';
#if 0
  printf("rot : %s\n",rot);
#endif
    if (  0 == strcmp( rot, ans) )
    {
      match=1;
      break;
    }
  }
  printf( "%s", (0==match)?"No":"Yes");
  return 0;
}