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 Fortran (GNU Fortran 9.2.1) (judge verdict: Accepted)

program prob2
    implicit none
    integer::i, l, j
    character(len=100)::S,T
    character::s1,t1
    read(*,*) S
    read(*,*) T
    l = len_trim(S)

    do j = 1, l
        do i = 1, l
            if(S(i:i) .ne. T(i:i))then
                exit
            else if(i == l)then
                write(*,'(a)') "Yes"
                stop
            end if
        end do
        s1 = S(1:1)
        t1 = T(1:1)
        do i = 1, l-1
            S(i:i) = S(i+1:i+1)
        end do
        S(l:l) = s1
    end do

    write(*,'(a)')  "No"
    stop
end program