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: Accepted)


s = gets.chomp
p = gets.chomp

n = 0
s.each_char do |i|
    k = s[n,s.size].index(p[0])
    if !k then
        break
    end
    n += k
    
    if (s[n,s.size] + s[0, n]).index(p) then
        print "Yes\n"
        exit
    end
    
    n += 1
end

print "No\n"