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

use std::io::BufReader;
use std::io::BufRead;
use std::io;
use std::io::prelude::*;

fn main() {
    let reader = io::stdin();
    let mut reader = BufReader::new(reader.lock());
    let mut s = String::new();
    let mut t = String::new();
    let mut s1 = Vec::new();
    String::new();

    reader.read_line(&mut s);
    reader.read_line(&mut t);

    let mut s = s.as_bytes().to_vec();
    let mut t = t.as_bytes().to_vec();
    let len = s.len();
    let mut loops = 0;


    'outer: for k in 0..len {
        loops += 1;
        for i in 0..s1.len() {
            if t[i] != s1[i] {
                let c = s.pop().unwrap();
                s1.push(c);
                continue 'outer;
            }
        }

        for (i, j) in (s1.len()..s.len()).enumerate() {
            if s[i] != t[j] {
                let c = s.pop().unwrap();
                s1.push(c);
                continue 'outer;
                if j == (len - 1) {
                    println!("Yes");
                    std::process::exit(0);
                }
            }
        }
    }
    println!("No");
}