#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, q;
  cin >> n >> q;
  string s;
  cin >> s;
  constexpr int m = 26;
  vector<array<int, m>> sum(n + 1);
  fill(sum[0].begin(), sum[0].end(), 0);
  rep(i, n) {
    sum[i + 1] = sum[i];
    sum[i + 1][s[i] - 'a']++;
  }
  while (q--) {
    int l, r, x;
    cin >> l >> r >> x;
    --l;
    array<int, m> prd;
    rep(j, m) prd[j] = sum[r][j] - sum[l][j];
    rep(j, m) {
      if (prd[j] >= x) {
        cout << (char) ('a' + j) << '\n';
        break;
      }
      x -= prd[j];
    }
  }
  return 0;
}