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>

int main(void) {
  char s[100];
  scanf("%s\n", s);
  int length;
  for (length = 0; s[length] != 0; length++);
  char t[length];
  scanf("%s", t);

  int i, j, result;
  char memo;
  for (i = 0; i < length; i++) {
    memo = s[length];
    for (j = 0; j < length; j++) {
      s[j] = s[j + 1];
    }
    s[length] = memo;
    for (j = 0; j < length; j++) {
      if (s[j] != t[j]) {
        result = 0;
        break;
      } else {
        result = 1;
      }
      if (result == 1) {
        break;
      }
    }
    if (result == 1) {
      break;
    }
  }

  switch (result) {
    case 0 : printf("No\n");
    break;
    case 1 : printf("Yes\n");
    break;
  }

  return 0;
}