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 C# (judge verdict: Wrong Answer)

using System;
class Program
{
    static void Main(string[] args)
    {
        char[] s = Console.ReadLine().ToCharArray();
        char[] p = Console.ReadLine().ToCharArray();
        for (int i = 0,scount = s.Length; i < scount; i++)
        {
            if (s[i] == p[0])
            {
                for (int j = 1, pcount = p.Length; j < pcount; j++)
                {
                    if (i + j == scount)
                    {
                        for (int k = 0, kcount = pcount - j + 1; k < kcount; k++)
                        {
                            if (j + k == pcount)
                            {
                                Console.WriteLine("Yes");
                                return;
                            }
                            if (s[k] != p[j + k])
                            {
                                Console.WriteLine("No");
                                return;
                            }
                        }
                    }

                    if (s[i + j] != p[j])
                    {
                        break;
                    }

                    if (j == pcount - 1)
                    {
                        Console.WriteLine("Yes");
                        return;
                    }
                }
            }
        }
        Console.WriteLine("No");
    }
}