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>
#define LEN 103

void rot(char *str, int n) {
  char tmp = str[n-1];
  int i;
  for(i = 0; i < n-1; ++i) {
    str[n-1-i] = str[n-2-i];
  }
  str[0] = tmp;
}

int main(void)
{
  int i, len, flag = 0;
  char s1[LEN], s2[LEN];
  scanf("%s", s1); scanf("%s", s2);
  len = strlen(s1);
  
  for(i = 0; i < len; ++i) {
    if(strcmp(s1, s2) == 0) { flag = 1; break; }
    rot(s1, len);
    if(strcmp(s1, s2) == 0) { flag = 1; break; }
  }
  if(flag == 1) { printf("Yes\n"); } else { printf("No\n"); }
  return 0;
}