#include <bits/stdc++.h>
using namespace std;
long long readInt() {
  long long x;
  cin >> x;
  return x;
}
const long long P = 10;
const long long mod = 1000000009;
template <typename T>
void printVector(const vector<T>& v) {
  for (const auto& u : v) {
    cout << u << " ";
  }
}
template <typename T>
void printVector(const vector<vector<T>>& v) {
  for (const auto& u : v) {
    printVector(u);
    cout << "\n";
  }
}
vector<long long> calcHashes(const string& s, char c) {
  long long curdeg = 1;
  long long curhash = 0;
  vector<long long> hashes{0};
  for (long long i = 0; i < s.size(); ++i) {
    if (s[i] == c) {
      curhash += curdeg;
      curhash %= mod;
    }
    curdeg = (curdeg * P) % mod;
    hashes.push_back(curhash);
  }
  return hashes;
}
long long pow(long long x, long long a) {
  long long res = 1;
  while (a > 0) {
    if (a % 2 == 1) {
      res = (res * x) % mod;
    }
    x = (x * x) % mod;
    a /= 2;
  }
  return res;
}
vector<long long> powers;
long long calcHash(const vector<long long>& hashes, long long l, long long r) {
  long long diff = hashes[r] - hashes[l - 1] + mod;
  diff %= mod;
  return (diff * powers[l]) % mod;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  scanf("%lld", &n);
  long long m;
  scanf("%lld", &m);
  vector<vector<long long>> hashes(26);
  for (long long i = 0; i < n + 4; ++i) {
    powers.push_back(pow(P, mod - i));
  }
  string s;
  char str[n];
  scanf("%s", str);
  for (long long i = 0; i < n; ++i) {
    s += str[i];
  }
  for (long long i = 0; i < 26; ++i) {
    hashes[i] = calcHashes(s, 'a' + i);
  }
  for (long long i = 0; i < m; ++i) {
    long long a, b, len;
    scanf("%lld %lld %lld", &a, &b, &len);
    vector<long long> hashes1;
    vector<long long> hashes2;
    for (long long j = 0; j < 26; ++j) {
      long long h1 = calcHash(hashes[j], a, a + len - 1);
      long long h2 = calcHash(hashes[j], b, b + len - 1);
      hashes1.push_back(h1);
      hashes2.push_back(h2);
    }
    sort(hashes1.begin(), hashes1.end());
    sort(hashes2.begin(), hashes2.end());
    if (hashes1 == hashes2) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
  }
  return 0;
}
