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");
    }
} import java.util.Scanner; Scanner java.util import java.util.Arrays; Arrays java.util 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");
    }
} Main public static void main(String[] args) {
        new Main().solve();
    } main {
        new Main().solve();
    } new Main().solve() new Main().solve new Main() String[] args args 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");
    } 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");
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) String S = sc.next(); S sc.next() sc.next sc String T = sc.next(); T sc.next() sc.next sc char[] s = S.toCharArray(); s S.toCharArray() S.toCharArray S char[] t = T.toCharArray(); t T.toCharArray() T.toCharArray T System.out.println("No") System.out.println System.out System System.out "No" 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");
    }
} 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");
    }
} Main
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");
    }
}