#include <bits/stdc++.h>
using namespace std;
int MOD[] = {int(1e9) + 7, int(1e9) + 133};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  string s;
  cin >> n >> m >> s;
  s = '*' + s;
  long long mul[4] = {1, 1, 1, 1};
  vector<vector<long long>> c(2, vector<long long>(n));
  c[0][0] = c[1][0] = 1;
  for (int k = 0; k < 2; ++k)
    for (int i = 1; i < n; ++i) c[k][i] = (c[k][i - 1] * 2333) % MOD[k];
  vector<vector<vector<long long>>> dp(
      2, vector<vector<long long>>(26, vector<long long>(n + 1)));
  for (int k = 0; k < 2; ++k)
    for (int i = 0; i < 26; ++i) dp[k][i][0] = 0;
  for (int i = 1; i <= n; ++i) {
    for (int k = 0; k < 2; ++k) mul[k] = (mul[k] * 2333) % MOD[k];
    for (int k = 0; k < 2; ++k)
      for (int j = 0; j < 26; ++j) {
        dp[k][j][i] = (dp[k][j][i - 1] + mul[k] * (s[i] == j + 97)) % MOD[k];
      }
  }
  vector<long long> h1(26), h2(26);
  while (m--) {
    int x, y, l;
    cin >> x >> y >> l;
    if (x > y) swap(x, y);
    bool ok = true;
    for (int k = 0; k < 2 && ok; ++k) {
      for (int i = 0; i < 26; ++i) {
        h1[i] = (((dp[k][i][x + l - 1] - dp[k][i][x - 1] + MOD[k]) % MOD[k]) *
                 c[k][y - x]) %
                MOD[k];
        h2[i] = (dp[k][i][y + l - 1] - dp[k][i][y - 1] + MOD[k]) % MOD[k];
      }
      sort(h1.begin(), h1.end());
      sort(h2.begin(), h2.end());
      for (int i = 0; i < 26; ++i)
        if (h1[i] != h2[i]) {
          ok = false;
          break;
        }
    }
    cout << ((ok) ? "YES" : "NO") << endl;
  }
  return 0;
}
