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 () {
   char s[100], t[100];
   int i, j, sn, tn;

   scanf("%s", s);
   scanf("%s", t);

   sn = strlen(s);
   tn = strlen(t);

   for (i = 0 ; ;i++) {
     for (j = 0; j < tn; j++) {
       if (s[i] != t[j]) {
         break;
       }
     }
   }

   if(tn == j-1) {
     printf("Yes\n");
   }  else {
       printf("No\n");
      }

   return 0;
}