#include <bits/stdc++.h>
using namespace std;
void inline accelerate_io() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
const long long MAXN = 200005;
const long long MOD = 998244353;
const long long SEED = 2333;
long long power[MAXN], hasht[26][MAXN];
int main() {
  long long n, m;
  cin >> n >> m;
  string s;
  cin >> s;
  for (int i = 0; i < 26; ++i) {
    for (int j = 0; j < n; ++j) {
      hasht[i][j] = (j > 0 ? SEED * hasht[i][j - 1] : 0) + (s[j] - 'a' == i);
      hasht[i][j] %= MOD;
    }
  }
  power[0] = 1;
  for (int i = 1; i < n; ++i) power[i] = SEED * power[i - 1] % MOD;
  vector<long long> hasha(26, 0), hashb(26, 0);
  while (m--) {
    long long a, b, l;
    cin >> a >> b >> l;
    a--;
    b--;
    for (int i = 0; i < 26; ++i) {
      hasha[i] =
          hasht[i][a + l - 1] - (a == 0 ? 0 : power[l] * hasht[i][a - 1] % MOD);
      hashb[i] =
          hasht[i][b + l - 1] - (b == 0 ? 0 : power[l] * hasht[i][b - 1] % MOD);
      hasha[i] = (hasha[i] + MOD) % MOD;
      hashb[i] = (hashb[i] + MOD) % MOD;
    }
    sort(hasha.begin(), hasha.end());
    sort(hashb.begin(), hashb.end());
    bool flag = true;
    for (int i = 0; i < 26; i++)
      if (hasha[i] != hashb[i]) flag = false;
    cout << (flag ? "YES" : "NO") << endl;
  }
}
