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: Time Limit Exceeded)

#include<stdio.h>
#include<string.h>

int main()
{
    int i,j,lens,lenp;
    char s[100],p[100];

    scanf("%s",s);
    scanf("%s",p);
    lenp = strlen(p);

    for(i=0; ;i++) {
      for(j = 0; j < lenp; j++) {
        if (s[i] != p[j]) {
          break;
        }
      }
    }
    
    if(j == lenp) {
      printf("Yes\n");
    } else {
      printf("No\n");
    }

    return 0;
}