#include <bits/stdc++.h>
using namespace std;
const int MXN = 2e5 + 5;
const int mod = 1e9 + 7;
int n, m;
string tab;
long long hasz[MXN][27], x = 41, a, b, dl;
vector<long long> s1, s2;
long long pot[MXN];
int main() {
  pot[0] = 1;
  for (int i = 1; i <= MXN - 5; i++) {
    pot[i] = (pot[i - 1] * x) % mod;
  }
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  cin >> tab;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 26; j++) {
      if (i == 0) {
        if (tab[i] == j + 'a')
          hasz[i][j] = 1;
        else
          hasz[i][j] = 0;
      } else {
        if (tab[i] == j + 'a')
          hasz[i][j] = (hasz[i - 1][j] * x + 1) % mod;
        else
          hasz[i][j] = (hasz[i - 1][j] * x) % mod;
      }
    }
  }
  for (int i = 0; i < m; i++) {
    s1.clear();
    s2.clear();
    cin >> a >> b >> dl;
    a--;
    b--;
    for (int j = 0; j < 26; j++) {
      if (a == 0) {
        long long pom = hasz[a + dl - 1][j];
        s1.push_back(pom);
      } else {
        long long pom = hasz[a + dl - 1][j] - (hasz[a - 1][j] * pot[dl]) % mod;
        while (pom < 0) pom += mod;
        s1.push_back(pom);
      }
      if (b == 0) {
        long long pom = hasz[b + dl - 1][j];
        s2.push_back(pom);
      } else {
        long long pom = hasz[b + dl - 1][j] - (hasz[b - 1][j] * pot[dl]) % mod;
        while (pom < 0) pom += mod;
        s2.push_back(pom);
      }
    }
    sort(s1.begin(), s1.end());
    sort(s2.begin(), s2.end());
    bool ok = 0;
    for (int j = 0; j < 26; j++) {
      if (s1[j] != s2[j]) ok = 1;
    }
    if (ok == 0)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
