/* -*- coding: utf-8 -*-
 *
 * 1471.cc:  No.1471 Sort Queries - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 10000;
const int M = 26;

/* typedef */

struct Vec {
  int v[M];
  Vec(): v() {}

  int &operator[](int i) { return v[i]; }

  Vec operator+(const Vec e) {
    Vec r;
    for (int i = 0; i < M; i++) r.v[i] = v[i] + e.v[i];
    return r;
  }

  Vec operator-(const Vec e) {
    Vec r;
    for (int i = 0; i < M; i++) r.v[i] = v[i] - e.v[i];
    return r;
  }
};

/* global variables */

char s[MAX_N + 4];
Vec cvs[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d%s", &n, &qn, s);

  for (int i = 0; i < n; i++) {
    cvs[i + 1] = cvs[i];
    cvs[i + 1][s[i] - 'a']++;
  }

  while (qn--) {
    int l, r, x;
    scanf("%d%d%d", &l, &r, &x);
    l--;

    Vec v = cvs[r] - cvs[l];
    for (int i = 0; i < M; i++) {
      if (x <= v[i]) {
	printf("%c\n", 'a' + i);
	break;
      }
      x -= v[i];
    }
  }
  return 0;
}