import java.util.Scanner;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) {
        new Main().solve();
    }

    void solve() {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        char[] s = S.toCharArray();
        char[] t = T.toCharArray();
        lavel:
        for (int i = 0; i < S.length(); i++) {
            int l = 0;
            for (int j = i; j < S.length(); j++, l++) {
                if (s[j] == t[l]) {
                } else {
                    continue lavel;
                }
                if (l == S.length() - 1 && i == 0) {
                    System.out.println("Yes");
                    return;
                }
            }
            for (int k =0; k < i; k++, l++) {
                if (s[k] == t[l]) {
                } else {
                    continue lavel;
                }
                if (l == S.length() - 1) {
                    System.out.println("Yes");
                    return;
                }
            }
        }
        System.out.println("No");
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz