#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxn = 200005;
long long mul = 114175;
int p1 = 97, p2 = 970127;
long long h[maxn][26];
long long p[maxn];
void build(string s) {
  long long now = mul;
  p[0] = 1;
  for (int i = 1; i < (int)s.size() + 1; i++) {
    p[i] = now;
    now *= mul;
    now %= mod;
  }
  for (int j = 0; j < 26; j++) {
    long long cur = 0;
    for (int i = 1; i <= (int)s.size(); i++) {
      cur *= mul;
      if (s[i - 1] - 'a' == j) {
        cur += p1;
      } else {
        cur += p2;
      }
      cur %= mod;
      h[i][j] = cur;
    }
  }
}
long long get(int l, int r, int x) {
  long long ret = (h[r][x] - (h[l - 1][x] * p[r - l + 1] % mod) + mod) % mod;
  return ret;
}
void go() {
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  build(s);
  while (k--) {
    int x, y, len;
    cin >> x >> y >> len;
    vector<int> st1, st2;
    for (int i = 0; i < 26; i++) {
      st1.push_back(get(x, x + len - 1, i));
      st2.push_back(get(y, y + len - 1, i));
    }
    sort(st1.begin(), st1.end());
    sort(st2.begin(), st2.end());
    if (st1 == st2) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int c = 0;
  int t;
  if (!c) {
    t = 1;
  } else {
    cin >> t;
  }
  while (t--) {
    go();
  }
}
