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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author hakamada
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        AtCoder109_2 solver = new AtCoder109_2();
        solver.solve(1, in, out);
        out.close();
    }

    static class AtCoder109_2 {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            String phrase = in.nextLine();
            String matcher = in.nextLine();
            if (phrase.compareTo(matcher) == 0) {
                out.println("Yes");
                return;
            }


            for (int i = 1; i < phrase.length(); i++) {
                String work1 = matcher.substring((matcher.length() - i));
                String work2 = matcher.substring(0, (matcher.length() - i));
                String work3 = work1 + work2;
                if (work3.compareTo(phrase) == 0) {
                    out.println("Yes");
                    return;

                }
            }

            out.println("No");
        }

    }
}