#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define fi first
#define se second
#define re0 return 0
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using tup = tuple<ll, ll, ll>;
using cp = complex<double>;
constexpr ll inf = 2e9;
constexpr ll llinf = 9e18;
//constexpr ll MOD = 998244353;
constexpr ll MOD = 1000000007;
const double pai = acos(-1);

int main() {
    //cout<<fixed<<setprecision(15);
    int n,q;cin>>n>>q;
    string s;cin>>s;
    rep(Q,q){
        int l,r,x;cin>>l>>r>>x;
        l--;
        vector<int> vec(26);
        REP(i,l,r)vec[s[i]-'a']++;
        ll cnt=0;
        rep(i,26){
            if(!vec[i])continue;
            if(cnt+vec[i]>=x){
                cout<<char('a'+i)<<endl;
                break;
            }
            cnt+=vec[i];
        }
    }
}