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 <stdlib.h>
#include <string.h>
#include <math.h>
 
int main()

{
  //int A, B, C, X, Y;
  char s[101]={};
  char s_temp[101]={};
  char t[101]={};
  int len=0;
  //  int a, b, c;
  int a[20000]={};
  int i,j,k;
  int flag=0;
  int tmp=0;
  int min=101;
  int max=0;

  long cnt =0;
  long long A_temp;
//    int k=0;

  scanf("%s", s);
  scanf("%s", t);
//  printf("%s\n", s);

  len = strlen(s);

  for(j=0;j<len;j++){
    for(i=0;i<len;i++){
      if(i==len-1) s_temp[0]=s[i];
      else         s_temp[i+1]=s[i]; 
    }
    strcpy(s,s_temp);
   if(strcmp(s, t)==0){
     printf("Yes\n", s);
     return 0;
   }
  }
  
  printf("No\n");  
  
return 0;
}