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.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main (String[] args){
        Scanner scan = new Scanner(System.in);
        String s = scan.next();
        String p = scan.next();
        String judge = "No";
        
        List<Integer> s_markList = new ArrayList<Integer>();


        for (int i = 0; i < s.length(); i++) {
            if(p.charAt(0) == s.charAt(i)){
                s_markList.add(i);
            }
        }
        
   
        Iterator<Integer> it = s_markList.iterator();
        while(it.hasNext()){
            Integer e =it.next();
            String ss = s;
            if(p.length() > s.length()-e){
                ss = s + s;
             
            }
            int f = 0;
          
            for(int i = e; i < e + p.length(); i++){
             
                if(ss.charAt(i) == p.charAt(f)){

                    if(f == p.length()-1){
    
                        judge = "Yes";
                        break;
                    }

                    f++;
                }else{
                    break;
                }
            }
        }
        
        System.out.println(judge);
        
    }
}