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()
{
  int n, i, j, temp;
  char s[101], t[101];
  gets(s);
  gets(t);  
  n = strlen(s);
  if(strcmp(s,t)==0)
  {
      printf("Yes\n");
      return 0;
  }
  for(i=1; i<n; i++)
  {
      temp = s[0];
      for(j=0; j<n-1; j++)
      {
          s[j] = s[j+1];
      }
      s[j] = temp;
      
      if(strcmp(s,t)==0)
      {
          printf("Yes\n");
          return 0;
      }
  }
  printf("No\n");
  
  return 0;
}