#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7, MOD2 = 392183103;
long long n, m, h[30][200010], h2[30][200010], pw[200010], pw2[200010],
    hn = 43828497, hn2 = 91737937, x, y, len;
pair<long long, long long> nh[30], nh2[30];
string s;
pair<long long, long long> gethash(long long let, long long lb, long long ub) {
  return {
      (h[let][ub + 1] - h[let][lb] * pw[ub - lb + 1] % MOD + MOD) % MOD,
      (h2[let][ub + 1] - h2[let][lb] * pw2[ub - lb + 1] % MOD2 + MOD2) % MOD2};
}
int main() {
  cin >> n >> m >> s;
  pw[0] = pw2[0] = 1;
  for (int i = 1; i <= n + 5; i++) {
    pw[i] = pw[i - 1] * hn % MOD;
    pw2[i] = pw2[i - 1] * hn2 % MOD2;
  }
  for (int i = 0; i < 26; i++) {
    for (int j = 1; j <= n; j++) {
      h[i][j] = (h[i][j - 1] * hn + (s[j - 1] == i + 'a' ? 1 : 0)) % MOD;
      h2[i][j] = (h2[i][j - 1] * hn2 + (s[j - 1] == i + 'a' ? 1 : 0)) % MOD2;
    }
  }
  for (int qn = 0; qn < m; qn++) {
    scanf("%I64d%I64d%I64d", &x, &y, &len);
    x--;
    y--;
    for (int i = 0; i < 26; i++) {
      nh[i] = gethash(i, x, x + len - 1);
      nh2[i] = gethash(i, y, y + len - 1);
    }
    sort(nh, nh + 26);
    sort(nh2, nh2 + 26);
    bool ok = true;
    for (int i = 0; i < 26; i++) {
      if (nh[i] != nh2[i]) {
        ok = false;
        break;
      }
    }
    puts(ok ? "YES" : "NO");
  }
  return 0;
}
