#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,q;cin >> n >> q;
    string s;cin >> s;
    vector<vector<int>> sm(n+1,vector<int>(26));
    REP(i,n){
        REP(j,26){
            if(s[i]-'a'==j) sm[i+1][j]=sm[i][j]+1;
            else sm[i+1][j]=sm[i][j];
        }
    }
    while(q--){
        int l,r,x;cin >> l >> r >> x;
        l--,r--;
        vector<int> c(26);
        REP(i,26) c[i]=sm[r+1][i]-sm[l][i];
        REP(i,26){
            x-=c[i];
            if(x<=0){
                cout << char(i+'a') << endl;
                break;
            }
        }
    }
}