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 PHP (5.6.30) (judge verdict: Wrong Answer)

<?php

 $S = fgets(STDIN);
 $T = fgets(STDIN);
 $count = strlen($S);
 $ans = "No";
 if($S == $T){
   $ans = "Yes";
 }
 for($i = 0; $i <= $count; $i++){
  $Slast = substr($S,-1);
  $S = $Slast . rtrim($S);
  if($S == $T){
    $ans = "Yes";
  }
 }
echo $ans;
  
?>