#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, q; string s; cin >> n >> q >> s;
  constexpr int C = 26;
  vector<int> sum[C];
  REP(i, C) {
    sum[i].assign(n + 1, 0);
    REP(j, n) sum[i][j + 1] = sum[i][j] + (s[j] == 'a' + i);
  }
  while (q--) {
    int l, r, x; cin >> l >> r >> x; --l; --r;
    REP(c, C) {
      x -= sum[c][r + 1] - sum[c][l];
      if (x <= 0) {
        cout << char('a' + c) << '\n';
        break;
      }
    }
    assert(x <= 0);
  }
  return 0;
}