#include <bits/stdc++.h>
using namespace std;
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
bool ispalindrome(string s) {
  string a = s;
  reverse((s).begin(), (s).end());
  return a == s;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  cin >> test;
  while (test--) {
    string s, t;
    cin >> s >> t;
    string a = s;
    reverse((s).begin(), (s).end());
    int n = a.size();
    if (a.find(t) != string::npos || s.find(t) != string::npos) {
      cout << "YES"
           << "\n";
      continue;
    }
    bool found = 0;
    for (int i = 1; i <= n; ++i) {
      string org = a.substr(0, i);
      string search = "";
      search += org;
      org.pop_back();
      reverse((org).begin(), (org).end());
      search += org;
      if (search.find(t) != string::npos) {
        found = 1;
        break;
      }
    }
    cout << (found ? "YES" : "NO") << "\n";
  }
}
