#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
long long n, m;
string s;
vector<long long> v[26];
long long h[26][200010];
long long qpow[200010];
const long long mod = 1000000009;
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> s;
  qpow[0] = 1;
  for (long long i = 1; i < 200010; i++) {
    qpow[i] = (qpow[i - 1] * 2) % mod;
  }
  for (long long i = 0; i < 26; i++) {
    for (long long j = 0; j < n; j++) {
      h[i][j] = h[i][j - 1] * 2;
      if (s[j] - 'a' == i) h[i][j]++;
      h[i][j] %= mod;
    }
  }
  for (long long i = 0; i < m; i++) {
    long long x, y, z;
    cin >> x >> y >> z;
    x--;
    y--;
    long long l1 = x, r1 = x + z - 1, l2 = y, r2 = y + z - 1;
    vector<long long> a, b;
    for (long long j = 0; j < 26; j++) {
      long long h1 =
          ((h[j][r1] - h[j][l1 - 1] * qpow[r1 - l1 + 1]) % mod + mod) % mod;
      long long h2 =
          ((h[j][r2] - h[j][l2 - 1] * qpow[r2 - l2 + 1]) % mod + mod) % mod;
      a.push_back(h1);
      b.push_back(h2);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    bool f = 1;
    for (long long j = 0; j < 26; j++) {
      if (a[j] != b[j]) {
        f = 0;
        break;
      }
    }
    if (f)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
