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 C++14 (GCC 5.4.1) (judge verdict: Runtime Error)


#include<bits/stdc++.h>
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());


void c_p_c()
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}

int32_t main()
{
  c_p_c();
  string a,b;
  cin >> a;
  cin >> b;
  if(a.size() != b.size())
  {
    cout<<"No"<<endl;
  }
  else
  {
      set <char> s1,s2;
      int pos = -1;
    for(int i=0;i<a.size();i++)
    {
      s1.insert(a[i]);
    }
    int t = 0;
    for(int i=0;i<b.size();i++)
    {
      if(b[i] == a[0] && t == 0)
      {
        pos = i;
        t = 1;
      }
      s2.insert(b[i]);
    }
    if(s1 != s2)
    {
      cout<<"No"<<endl;
    }  
    else
    {
      int n = a.size(),flag = 0;
      for(int i=0;i<n;i++)
      {
        if(a[i] != b[(i + pos)%n])
        {
          flag = 1;
          break;
        }
        // cout<<a[i]<<" "<<b[(i + pos)%n]<<endl;
      }
      if(flag == 0)
      {
        cout<<"Yes"<<endl;
      }
      else
      {
        cout<<"No"<<endl;
      }
    }
  }
  
  return 0;
}