#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000005;
const long long INFLL = 1000000000000000002ll;
const long long MOD = 1000000007;
inline long long min(long long a, long long b, long long c) {
  return min(min(a, b), c);
}
inline long long min(long long a, long long b, long long c, long long d) {
  return min(min(min(a, b), c), d);
}
inline long long max(long long a, long long b, long long c) {
  return max(max(a, b), c);
}
inline long long max(long long a, long long b, long long c, long long d) {
  return max(max(max(a, b), c), d);
}
int A[500005], N, Q;
long long E[500005], H[27][500005];
long long get(int c, int l, int r) {
  int len = r - l + 1;
  long long a = H[c][r];
  long long b = (H[c][l - 1] * E[len]) % MOD;
  long long ret = a - b + MOD;
  if (ret > MOD) ret -= MOD;
  return ret;
}
bool equal(int a, int b, int l) {
  multiset<int> sa, sb;
  for (int c = (0); c <= (25); c++) {
    sa.insert(get(c, a, a + l - 1));
  }
  for (int c = (0); c <= (25); c++) {
    sb.insert(get(c, b, b + l - 1));
  }
  return sa == sb;
}
int main() {
  ios_base::sync_with_stdio(false);
  string str;
  cin >> N >> Q >> str;
  for (int i = (1); i <= (N); i++) A[i] = str[i - 1] - 'a';
  for (int c = (0); c <= (25); c++) {
    long long h = 0;
    for (int i = (1); i <= (N); i++) {
      h *= 2;
      if (A[i] == c) h++;
      h %= MOD;
      H[c][i] = h;
    }
  }
  E[0] = 1;
  for (int i = (1); i <= (500000); i++) E[i] = (E[i - 1] * 2) % MOD;
  while (Q--) {
    int a, b, l;
    cin >> a >> b >> l;
    if (equal(a, b, l))
      cout << "YES\n";
    else
      cout << "NO\n";
  }
}
