Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Ring

Write a program which finds a pattern $p$ in a ring shaped text $s$.

Input

In the first line, the text $s$ is given.

In the second line, the pattern $p$ is given.

Output

If $p$ is in $s$, print Yes in a line, otherwise No.

Constraints

$1 \leq $ length of $p \leq $ length of $s \leq 100$

$s$ and $p$ consists of lower-case letters

Sample Input 1

vanceknowledgetoad
advance

Sample Output 1

Yes

Sample Input 2

vanceknowledgetoad
advanced

Sample Output 2

No

Solution in Ruby (judge verdict: Wrong Answer)

s = gets.chomp
p = gets.chomp

result = 'No'

if s.match(/#{p}/)
  result = 'Yes'
else
  i = 1
  while i < s.length
    if s.match(/#{p[i..-1]}/) && s[(-1*i)..-1] == p[0..(i-1)]
      result = 'Yes'
      break
    end
    i += 1
  end
end

puts result