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 Java7 (OpenJDK 1.7.0) (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner input = new Scanner(System.in);
		String S = input.nextLine();
		String T = input.nextLine();
		String[] SList = S.split("");

		String tmpS = "";
		boolean flag = false;
		for (int i = 0; i < SList.length; i++) {
			// 文字を末尾を除外して連結
			for (int j = 0; j < SList.length - 1; j++) {
				tmpS += SList[j];
			}
			// 末尾を先頭に移動
			tmpS = SList[SList.length - 1] + tmpS;

			if (tmpS.equals(T)) {
				System.out.println("Yes");
				flag = true;
				break;
			} else {
				// 一致しなかった場合、配列に入れ替えたデータを設定
				SList = tmpS.split("");
				tmpS = "";
			}
		}
		if (!flag) {
			System.out.println("No");
		}
		input.close();
	}
}