Words#2200
Various operations can be used to encrypt words. For example, consider the following operation: take the first several letters of a given word, append them in reverse order to the end of the word, then remove them from the beginning. Thus, the word a_1a_2\dots a_ka_{k+1}\dots a_n becomes a_{k+1}\dots a_na_ka_{k-1}\dots a_1, where is chosen from the range to .
Given two words, determine whether applying the described operation to the first word can produce the second word.
The input consists of two lines: the first line contains the given word, and the second line contains the expected result. The length of each line does not exceed characters.
Print Yes on the first line if the transformation is possible; otherwise, print No. If the answer is Yes, also print on the second line — the length of the segment moved from the beginning (choose the smallest such ).
Example 1