Problem:
Score : 200 points

Problem Statement

You are given string S and T consisting of lowercase English letters.

Determine if S equals T after rotation.

That is, determine if S equals T after the following operation is performed some number of times:

Operation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.

Here, |X| denotes the length of the string X.

Constraints

2 \leq |S| \leq 100

|S| = |T|

S and T consist of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S
T

Output

If S equals T after rotation, print Yes; if it does not, print No.

Sample Input 1

kyoto
tokyo

Sample Output 1

Yes

In the first operation, kyoto becomes okyot.

In the second operation, okyot becomes tokyo.

Sample Input 2

abc
arc

Sample Output 2

No

abc does not equal arc after any number of operations.

Sample Input 3

aaaaaaaaaaaaaaab
aaaaaaaaaaaaaaab

Sample Output 3

Yes

Solution in Rust (1.15.1) (judge verdict: Accepted)

fn main(){
    let s: String = read();
    let t: String = read();
    
    let mut ans = "No";
    
    for i in 0..s.len() {
        if rotate(&s, i) == t {
            ans = "Yes";
            break;
        }
    }
    
    println!("{}", ans);
}

fn rotate(s: &String, n: usize) -> String {
    let b = s.clone().into_bytes();
    let t = b.split_at(n);
    let mut f = t.1.to_vec();
    let mut e = t.0.to_vec();
    f.append(&mut e);
    String::from_utf8(f).ok().unwrap()
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}