#include <bits/stdc++.h>
using namespace std;
long long int n, m, tut[200005 + 105], hashed[200005 + 105][28], x, y, len,
    say[200005 + 105][28], tyz;
long long int temp1[29], temp2[29];
string s;
vector<long long int> v[29];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  tut[0] = 1;
  for (int i = 1; i <= 200005; i++)
    tut[i] = (tut[i - 1] % 1000000007) * 29 % 1000000007;
  cin >> n >> m >> s;
  for (int i = 0; i < (int)s.size(); i++) {
    hashed[i][s[i] - 'a'] =
        (hashed[i][s[i] - 'a'] % 1000000007 + tut[i] % 1000000007) % 1000000007;
    v[s[i] - 'a'].push_back(i);
    say[i][s[i] - 'a']++;
  }
  for (int i = 1; i < (int)s.size(); i++) {
    for (int j = 0; j <= 25; j++) {
      hashed[i][j] =
          (hashed[i][j] % 1000000007 + hashed[i - 1][j] % 1000000007) %
          1000000007;
      say[i][j] += say[i - 1][j];
    }
  }
  for (int i = 1; i <= m; i++) {
    cin >> x >> y >> len;
    x--;
    y--;
    if (x > y) swap(x, y);
    int flag = 0;
    memset(temp1, 0, sizeof(temp1));
    memset(temp2, 0, sizeof(temp2));
    for (int j = 0; j <= 25; j++) {
      temp1[j] =
          ((hashed[x + len - 1][j] % 1000000007 -
            ((x >= 1 ? hashed[x - 1][j] % 1000000007 : 0)) + 1000000007) %
           1000000007) *
          (tut[y - x] % 1000000007) % 1000000007;
      temp2[j] =
          ((hashed[y + len - 1][j] % 1000000007 -
            ((y >= 1 ? hashed[y - 1][j] % 1000000007 : 0)) + 1000000007) %
           1000000007) %
          1000000007;
    }
    sort(temp1, temp1 + 26);
    sort(temp2, temp2 + 26);
    for (int j = 0; j <= 25; j++) {
      if (temp1[j] != temp2[j]) {
        flag = 1;
        break;
      }
    }
    if (flag == 1)
      cout << "NO\n";
    else
      cout << "YES\n";
  }
  return 0;
}
