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 Python (2.7.6) (judge verdict: Wrong Answer)

c = raw_input().split()
d =raw_input().split()
 
 
a = list(c[0])
b = list(d[0])
 
 
size= len(a)
bsize = len(b)
 
numsum = 0
numsummax =0
 
for i in range(size): 
    for j in range(size): 
        
 
            
        if a[j] == b[(i+j)%size]: 
 
            numsum = numsum +1
            
        else:
            numsum = 0
            
        
    if numsummax<numsum:
            numsummax = numsum
 
if size == bsize and numsummax == size: 
    print "Yes" 
else: 
    print "No"