#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <bitset>
#define FOR(i,x,n) for(__typeof(x) i = (x); i != (n); i++)
#define FRI(it,v) FOR(it,v.begin(),v.end())
#define FR(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define SZ size()
#define PB push_back
#define MP make_pair
#define show(x) cerr<<#x<<"="<<x<<endl

using namespace std;

typedef pair<int, int> Pr;
typedef long long LL;
const LL INF = 1LL <<50;

using namespace std;

bool find(string s, string t) {
  FR(times,2) {
    FR(i,(int)s.SZ) {
      string r = s.substr(i) + s.substr(0,i);
      if (r.find(t) != r.npos)
	return true;
    }
    reverse(ALL(s));
  }
  return false;
}

int main() {
  int n;  cin >> n;
  for (string s, t; cin >> s >> t; ) 
    cout << (find(s,t) ? "YES" : "NO") << endl;
  return 0;
}