#line 1 "c.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
#pragma endregion Macros

#line 1 "/home/siro53/kyo-pro/compro_library/data_structure/BIT.hpp"
template <typename T> struct BIT {
    int n;
    vector<T> bit;
    BIT(int _n) { init(_n); }
    void init(int _n) {
        n = _n + 1;
        bit.resize(n + 1, 0);
    }
    // [0, k)
    T sum(int k) {
        T res = 0;
        for(int i = k - 1; i >= 0; i = (i & (i + 1)) - 1) { res += bit[i]; }
        return res;
    }
    // [l, r)
    T sum(int l, int r) { return (l < r ? sum(r) - sum(l) : 0); }
    // bit[k] += x
    void add(int k, T x) {
        for(int i = k; i < n; i |= i + 1) { bit[i] += x; }
    }
    // v[0] + ... + v[res] >= x
    int lower_bound(T x) {
        int res = -1;
        int k = 1;
        while(2 * k <= n) { k <<= 1; }
        for(; k > 0; k >>= 1) {
            if(res + k < n && bit[res + k] < x) {
                x -= bit[res + k];
                res += k;
            }
        }
        return res + 1;
    }
};
#line 70 "c.cpp"

int N, Q;
string s;

int main() {
    cin >> N >> Q;
    cin >> s;

    vector<BIT<int>> alps(26, BIT<int>(N));
    REP(i, N) alps[s[i] - 'a'].add(i, 1);

    REP(_, Q) {
        int l, r, x;
        cin >> l >> r >> x;
        l--;
        int sum = 0;
        REP(i, 26) {
            sum += alps[i].sum(l, r);
            if(sum >= x) {
                cout << (char)('a' + i) << "\n";
                break;
            }
        }
    }
}