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 s[100], t[100], tmp;
  scanf("%s", s);
  scanf("%s", t);
  int len=strlen(s), i, j, start=len+1, or=0, sousa=1;
  for(i=0;i<2;i++){
    for(j=0;j<len;j++){
      if(or==0){
        if(s[j]==t[0]){
          or++;
          if(j==0){
            start=len-1;
          } else {
            start=j;
          }
        }
      } else {
        if(s[j]==t[sousa]){
          sousa++;
          if(j==start-1){
            puts("Yes");
            return 0;
          }
        } else {
          sousa=1;
          or--;
          start=len+1;
        }
      }
    }
  }
  puts("No");
  return 0;
}