#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long f = 1, x = 0;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int MAXN = 2e5 + 5;
const int MOD1 = 1e9 + 7;
const int MOD2 = 1e9 + 9;
const int B1 = 41;
const int B2 = 37;
char s[MAXN];
int n, m, hs1[26][MAXN], hs2[26][MAXN], pw1[MAXN], pw2[MAXN];
inline pair<int, int> get(int c, int l, int r) {
  return (make_pair(((long long)hs1[c][r] -
                     (long long)hs1[c][l - 1] * pw1[r - l + 1] % MOD1 + MOD1) %
                        MOD1,
                    ((long long)hs2[c][r] -
                     (long long)hs2[c][l - 1] * pw2[r - l + 1] % MOD2 + MOD2) %
                        MOD2));
}
int main() {
  scanf("%d%d", &n, &m);
  scanf("%s", s + 1);
  for (int j = 0; j < 26; ++j) {
    for (int i = 1; i <= n; ++i) {
      hs1[j][i] =
          ((long long)hs1[j][i - 1] * B1 % MOD1 + ((s[i] - 'a') == j ? 2 : 1)) %
          MOD1;
      hs2[j][i] =
          ((long long)hs2[j][i - 1] * B2 % MOD2 + ((s[i] - 'a') == j ? 2 : 1)) %
          MOD2;
    }
  }
  pw1[0] = pw2[0] = 1;
  for (int i = 1; i <= n; ++i) {
    pw1[i] = (long long)pw1[i - 1] * B1 % MOD1;
    pw2[i] = (long long)pw2[i - 1] * B2 % MOD2;
  }
  while (m--) {
    multiset<pair<int, int> > A, B;
    int x, y, len;
    scanf("%d%d%d", &x, &y, &len);
    for (int i = 0; i < 26; ++i) {
      A.insert(get(i, x, x + len - 1));
      B.insert(get(i, y, y + len - 1));
    }
    if (A == B)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
