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 Scala (2.11.7) (judge verdict: Accepted)

object Main extends App {
  def rotate(chars:Array[Char]) = {
    chars.last +: chars.init
  }
  def isEqual(chars1:Array[Char],chars2:Array[Char]) = {
    (0 until chars1.length).map(i=>{
      chars1(i)==chars2(i)
    }).forall(f=>f)
  }
  val scanner = new java.util.Scanner(System.in)
  var s = scanner.next().toCharArray
  val t = scanner.next().toCharArray
  var flag = false
  (0 until s.length).foreach(_ => {
    if (isEqual(s,t)){
      flag = true
    }
    s = rotate(s)
  })
  if (flag){
    println("Yes")
  } else {
    println("No")
  }
}