#include <bits/stdc++.h>
using namespace std;
struct Hashes {
  vector<vector<int> > PH;
  vector<int> PO;
  vector<vector<int> > NEXT;
  Hashes(string s)
      : PH(26, vector<int>(s.size())),
        PO(s.size(), 1),
        NEXT(26, vector<int>(s.size(), -1)) {
    for (int i = 1; i < s.size(); ++i) {
      PO[i] = (((PO[i - 1]) * 1LL * (31LL)) % 1000000009);
    }
    for (int i = 0; i < 26; ++i) {
      int h = 0;
      for (int j = 0; j < s.size(); ++j) {
        h = ((31LL * (h) + (s[j] == i + 'a')) % 1000000009);
        PH[i][j] = h;
      }
      int last = -1;
      for (int j = s.size() - 1; j >= 0; --j) {
        if (s[j] == i + 'a') {
          last = j;
        }
        NEXT[i][j] = last;
      }
    }
  }
  int query(int c, int i, int j) {
    if (i == 0) return PH[c][j];
    return (PH[c][j] > (((PH[c][i - 1]) * 1LL * (PO[j - i + 1])) % 1000000009)
                ? (PH[c][j] -
                   (((PH[c][i - 1]) * 1LL * (PO[j - i + 1])) % 1000000009)) %
                      1000000009
                : (PH[c][j] -
                   (((PH[c][i - 1]) * 1LL * (PO[j - i + 1])) % 1000000009) +
                   1000000009) %
                      1000000009);
  }
  int query(int i, int j) {
    vector<int> IDS;
    for (int c = 0; c < 26; ++c) {
      if (NEXT[c][i] == -1 || NEXT[c][i] > j) continue;
      IDS.push_back(c);
    }
    sort(IDS.begin(), IDS.end(),
         [&](int a, int b) { return NEXT[a][i] < NEXT[b][i]; });
    int tot = 0;
    for (int c = 0; c < IDS.size(); ++c) {
      tot =
          (((tot) + ((((query(IDS[c], i, j)) * 1LL * (c + 1)) % 1000000009))) %
           1000000009);
    }
    return tot;
  }
};
int main(int argc, char *argv[]) {
  int N, M;
  cin >> N >> M;
  string S = "abcd";
  cin >> S;
  Hashes H(S);
  for (int i = 0; i < M; ++i) {
    int x, y, l;
    scanf("%d%d%d", &x, &y, &l);
    x--;
    y--;
    puts((H.query(x, x + l - 1) == H.query(y, y + l - 1) ? "YES" : "NO"));
  }
}
