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 JAVA (judge verdict: Accepted)

import java.util.Scanner;

class Main{
  public static void main(String args[]){
    Scanner sc = new Scanner(System.in);
    String strs = sc.next();
    String strp = sc.next();
    int snum = strs.length();
    int psum = strp.length();
    
    for(int p = 0; p < snum; p++){
      String str1 = "";
      String str2 = "";
      String str3 = "";
      for(int q = p; q < snum; q++){
        char c1 = strs.charAt(q);
        str1 += c1;
      }
      for(int r = 0; r < p; r++){
        char c2 = strs.charAt(r);
        str2 += c2;
      }
      for(int s = 0; s < psum; s++){
        char c3 = (str1+str2).charAt(s);
        str3 += c3;
      }
      
      if(str3.equals(strp)){
        System.out.println("Yes");
        break;
      }else if(p == snum-1){
        System.out.println("No");
      }
    }
  }
}