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(){

  char str[2][105]={{0}};
  scanf("%s",str[0]);
  scanf("%s",str[1]);

  int i;int f=0;
  int j;
  int size=0;
  while(str[0][size] !=0){
    size++;
  }
  for(i=0;i<size;++i){
    int j;
    if(memcmp(str[0],str[1],sizeof(str[0]))==0){
      f=1;
      break;
    }else{
      char temp=str[0][size-1];
      for(j=size-1;j>0;j--){
        str[0][j]=str[0][j-1];
      }
      str[0][0]=temp;
    }
  }
  if(f==0)puts("No");
  if(f==1)puts("Yes");
  return 0;
}