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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<iostream>
#include<vector>
#include<stdlib.h>
#include<time.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
char S[150];
char S1[150];

void rotate(){
 for(int i=1; i<strlen(S1); i++){
  S1[i]=S[i-1];
 }
 S1[0]=S[strlen(S)-1];
 for(int i=0; i<=strlen(S1); i++)S[i]=S1[i];
}

int main(void){
 char T[150];
 int OK=0;

 cin>>S>>T;

 for(int i=0; i<=strlen(S);i++)S1[i]=S[i];
 for(int i=0; i<strlen(S); i++){
  if(strcmp(S1,T)==0){
   OK=1;
   break;
  }
  rotate();
 }
 if(OK)std::cout<<"Yes"<<std::endl;
 else std::cout<<"No"<<std::endl;
}