#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

template<typename T> T gcd(T a, T b){ return a % b ? gcd(b, a % b) : b; }
template<typename T> T lcm(T a, T b){ return a / gcd(a, b) * b; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Q;
    string S;
    cin >> N >> Q >> S;

    S = '?' + S;
    vector cnt(N+1, vector<int>(26, 0));

    rep(i, 1, N+1){
        rep(j, 0, 26){
            cnt[i][j] = cnt[i-1][j];
            if(S[i] == char('a' + j)) ++cnt[i][j];
        }
    }

    while(Q--){
        int L, R, X;
        cin >> L >> R >> X;

        vector<int> cnt2(26);
        rep(i, 0, 26) cnt2[i] = cnt[R][i] - cnt[L-1][i];

        rep(i, 0, 26){
            if(cnt2[i] >= X){
                cout << char('a' + i) << endl;
                break;
            }
            X -= cnt2[i];
        }
    }

    return 0;
}