#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long f = 102937428;
int main() {
  int n, m;
  cin >> n >> m;
  string in;
  in.reserve(n);
  cin >> in;
  vector<vector<int>> order(n + 1, vector<int>(0));
  vector<vector<long long>> hash(26, vector<long long>(n + 1));
  vector<long long> shift(n + 1);
  shift[0] = 1;
  for (int j = 0; j < 26; j++) {
    hash[j][0] = 0;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 26; j++) {
      hash[j][i + 1] = (hash[j][i] * f) % mod;
    }
    hash[in[i] - 'a'][i + 1] += 1;
    hash[in[i] - 'a'][i + 1] %= mod;
    shift[i + 1] = (shift[i] * f) % mod;
    order[i + 1].push_back(in[i] - 'a');
    for (auto v : order[i]) {
      if (v == in[i] - 'a') continue;
      order[i + 1].push_back(v);
    }
  }
  for (int i = 0; i < m; i++) {
    int x, y, len;
    cin >> x >> y >> len;
    x--;
    y--;
    int xe = x + len;
    int ye = y + len;
    bool isOk = true;
    for (int j = 0; j < 26; j++) {
      long long v1 = 0, v2 = 0;
      if (j < order[xe].size()) {
        v1 = hash[order[xe][j]][x];
        v1 *= shift[len];
        v1 %= mod;
        v1 = mod - v1;
        v1 %= mod;
        v1 += hash[order[xe][j]][xe];
        v1 %= mod;
      }
      if (j < order[ye].size()) {
        v2 = hash[order[ye][j]][y];
        v2 *= shift[len];
        v2 %= mod;
        v2 = mod - v2;
        v2 %= mod;
        v2 += hash[order[ye][j]][ye];
        v2 %= mod;
      }
      if (v1 != v2) isOk = false;
    }
    if (isOk)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
