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 C (Clang 3.8.0) (judge verdict: Accepted)

#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <stdint.h>
#include <string.h>
#include <wchar.h>

#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define ABSS(a, b) (a > b ? a - b : b - a)

static void rotateString(char * S) {
	char buf[2];
	const size_t len = strlen(S);
	buf[1] = S[len - 1];
	for (uint32_t i = 0; i < len; i++) {
		buf[i%2] = S[i];
		S[i] = buf[(i + 1)%2];
	}
}

int main(void) {
	char S[101], T[101];

	scanf("%s\n%s", S, T);

	bool match = false;
	for (uint32_t i = 0; i < strlen(S); i++) {
		if (strcmp(S, T) == 0) {
			match = true;
			break;
		}
		rotateString(S);
	}

	puts((match ? "Yes" : "No"));

	return 0;
}