Circular Equivalence of Binary Strings

Given two binary strings S₁ and S₂, determine whether S₂ can be obtained by a cyclic rotation of S₁. In other words, check if S₂ is a substring of S₁ concatenated with itself.

More formally, for two strings S₁ and S₂ of equal length, S₂ is said to be circularly equivalent to S₁ if and only if there exists an integer k (0 ≤ k < |S₁|) such that:

\[ S_2 = S_1[k:] \; \Vert \; S_1[:k] \]

If the strings have different lengths, they are considered not equivalent.

inputFormat

The input consists of two lines. The first line contains the binary string S₁, and the second line contains the binary string S₂.

Both strings consist only of the characters '0' and '1'.

outputFormat

Output a single line: YES if the two strings are circularly equivalent; otherwise, output NO.

11001100
11001100

YES