Thuc likes finding cyclic shifts of strings. A cyclic shift of a string is obtained by moving characters from the beginning of the string to the end of the string. We also consider a string to be a cyclic shift of itself. For example, the cyclic shifts of ABCDE are:

ABCDE, BCDEA, CDEAB, DEABC, and EABCD.

Given some text, $T$, and a string, $S$, determine if $T$ contains a cyclic shift of $S$.

The input will consist of exactly two lines containing only uppercase letters. 

The first line will be the text $T$.

The second line will be the string $S$. 

Each line will contain at most 1000 characters.

Output yes if the text, $T$, contains a cyclic shift of the string, $S$. Otherwise, output no.

yes

CDEAB is a cyclic shift of ABCDE and is contained in the text ABCCDEABAA.

no

The cyclic shifts of ABA are ABA, BAA, and AAB. None of these shifts are contained in the text ABCDDEBCAB.