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 PHP7 (7.0.15) (judge verdict: Accepted)

<?php
$s=trim(fgets(STDIN));
$t=trim(fgets(STDIN));
$n=strlen($s);
$i=0;
while($i<$n){
  $ans="Yes";
  $j=0;
  while($j<$n){
    $c=$i+$j;
    if($c>=$n){
      $c-=$n;
    }
	if($s[$j]!=$t[$c]){
      $ans="No";
	    }
    	++$j;
  	}
  	if($ans=="Yes"){
    	echo $ans;
    	exit;
  	}
  	++$i;
}
echo $ans;