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 Common Lisp (SBCL 2.0.3) (judge verdict: Accepted)

(let ((l1 (concatenate 'list (read-line)))
      (l2 (concatenate 'list (read-line))))

  (defun f (lst)
    (reverse (cdr (reverse (append (last lst) lst)))))


  (defun g (lst1 lst2 &optional (cnt (length lst1)))
    (if (minusp cnt)
      nil
      (if (equal lst1 lst2)
        T
        (g (f lst1) lst2 (1- cnt)))))


  (format t "~A~%"
          (if (g l1 l2)
            "Yes"
            "No")))