Contest: Task: Related: TaskA TaskC

Score : $200$ points

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$.

- $2 \leq |S| \leq 100$
- $|S| = |T|$
- $S$ and $T$ consist of lowercase English letters.

Input is given from Standard Input in the following format:

$S$ $T$

If $S$ equals $T$ after *rotation*, print `Yes`

; if it does not, print `No`

.

kyoto tokyo

Yes

- In the first operation,
`kyoto`

becomes`okyot`

. - In the second operation,
`okyot`

becomes`tokyo`

.

abc arc

No

`abc`

does not equal `arc`

after any number of operations.

aaaaaaaaaaaaaaab aaaaaaaaaaaaaaab

Yes