output_description: If S equals T after _rotation_ , print `Yes`; if it does not, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
      T
attempt: A = input()
  B = input()
  for i in range(len(A)):
  if(A == B):
  　　print("Yes")
  　　exit()
  　　A = (A+A[0])[1:]
  print("No")
  
problem_description: 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.
samples: [{"input": "kyoto\n    tokyo", "output": "Yes\n    \n\n  * In the first operation, `kyoto` becomes `okyot`.\n  * In the second operation, `okyot` becomes `tokyo`.\n\n* * *"}, {"input": "abc\n    arc", "output": "No\n    \n\n`abc` does not equal `arc` after any number of operations.\n\n* * *"}, {"input": "aaaaaaaaaaaaaaab\n    aaaaaaaaaaaaaaab", "output": "Yes"}]