#include using namespace std; using ll = long long; using ld = long double; using pll = pair; constexpr ll MOD = 1e9 + 7; //constexpr ll MOD = 998244353; //constexpr ll MOD = ; ll mod(ll A, ll M) {return (A % M + M) % M;} constexpr ll INF = 1LL << 60; template bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll divceil(ll A, ll B) {return (A + (B - 1)) / B;} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) int main() { ll N, Q; cin >> N >> Q; string S; cin >> S; vector> A(N + 1, vector(26, 0)); for (ll i = 0; i < N; i++) { for (ll j = 0; j < 26; j++) { A.at(i + 1).at(j) = A.at(i).at(j); } A.at(i + 1).at(S.at(i) - 'a')++; } for (ll q = 0; q < Q; q++) { ll L, R, X; cin >> L >> R >> X; vector V(26); for (ll j = 0; j < 26; j++) { V.at(j) = A.at(R).at(j) - A.at(L - 1).at(j); } char ans; ll tmp = 0; for (ll j = 0; j < 26; j++) { tmp += V.at(j); if (tmp >= X) { ans = 'a' + j; break; } } cout << ans << endl; } }