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: Wrong Answer)

#include <stdio.h>
#include <string.h>
#define String_max 101
void RotateString(char str1[], char str2[], int gap);

int main(int argc, char const *argv[]) {
  char In1[String_max], In2[String_max];
  //入力
    scanf("%s", In1);
    scanf("%s", In2);
  //文字列の回転
  int str_len = strlen(In1);   //文字列の長さ
  char buff[String_max];    //回転後の文字列
  int gap = 1;  //ズレ
  int flag = 0;
  for (int i = 0; i < str_len; i++) {
    RotateString( In1, buff, gap);
    //printf("%s\n",buff);
    if ( strcmp(In2, buff) == 0 ) {
      flag = 1;
      break;
    }
    gap ++;
  }
  //出力
  if ( flag == 1) {
    printf("Yes\n");
  } else {
    printf("No\n");
  }
  return 0;
}

void RotateString(char str1[], char str2[], int gap){
  int str_len = strlen(str1);
  for (int i = 0; i < str_len; i++) {
    str2[(i+gap)%str_len] = str1[i];
  }
}