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: Wrong Answer)

import java.io.*;

class Main{
	public static void main(String args[]) throws IOException{
		BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
		String s = buf.readLine();
		String p = buf.readLine();
		char[] cs;
		char[] cp;
		String result = "";

		cs = s.toCharArray();
		cp = p.toCharArray();
		if(s.length() == 0 || p.length() == 0)
			result = "No";
		for(int i=0; i<s.length(); i++){
			if(cs[i] == cp[0]){
				for(int k=i, j=0; j<p.length(); k++,j++){
					if(k==s.length() && j<p.length()){
						k=0;
					}
					if(cs[k] != cp[j]){
						result = "No";
						break;
					}
					if(cs[k] == cp[j] && j==p.length()-1)
						result = "Yes";								
				}
			} else if(cs[i] != cp[0] && i==s.length()-1){
				result = "No";

			}
		}
		System.out.println(result);

	}
}