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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>

int main()
{
	char s[101] = {NULL};
	char t[101] = { NULL };


	scanf("%s", s);
	scanf("%s", t);

	int len = (int)strlen(s);

	int n = 0;
	int temp = 0;


	for (int i = 0; i < len; i++)
	{
		for (int j = 0; j < len; j++)
		{
			if (s[j] != t[j]) break;
			if (j = len - 1) n = 1;
		}

		if (n = 1) break;

		temp = s[0];
		for (int j = 0; j < len - 1; j++)
		{
			s[j] = s[j + 1];
		}
		s[len] = temp;
	}

	char yes[5]="Yes";
	char no[5] = "No";
	if (n = 0) 	printf("%s", no);
	if (n = 1) 	printf("%s", yes);





	return 0;
}