#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<map>
#include<vector>
#include<algorithm>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = size_t;
using u32 = uint_fast32_t;
using u64 = uint_fast64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
template<typename T>
using vec = vector<T>;
#define rep(i, n) for (i64 i = 0; i < (i64)(n); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define len(hoge) (i64)((hoge).size())
using P = pair<i64,i64>;
template<class T, class S> ostream &operator<<(ostream &os, const pair<T,S> &p){
    os << p.first << " " << p.second;
    return os;
}
void solve(){
}
int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    i64 n,q;
    cin >> n >> q;
    string s;
    cin >> s;
    vec<map<char,i64>> mp(len(s) + 1);
    rep(i,n) {
        mp[i + 1] = mp[i];
        mp[i + 1][s[i]]++;
    }
    rep(i,q) {
        i64 l,r,x;
        cin >> l >> r >> x;
        auto v1 = mp[r];
        auto v2 = mp[l - 1];
        map<char,i64> mp_2;
        for(char j = 'a'; j <= 'z'; j += 1) {
            //cout << j << " ";
            mp_2[j] = max(v1[j],v2[j]) - min(v1[j], v2[j]);
            //cout << mp_2[j] << " ";
        }
        i64 cnt = 0;
        for(auto [key,val]:mp_2) {
            cnt += val;
            if(cnt >= x) {
                cout << key << endl;
                break;
            }
        }
    }
}