#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, q;
    cin >> n >> q;
    string s;
    cin >> s;
    vector<array<int, 26>> S(n+1);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < 26; ++j) {
            S[i+1][j] += S[i][j];
        }
        S[i+1][s[i]-'a']++;
    }
    while(q--){
        int l, r, x;
        scanf("%d %d %d", &l, &r, &x);
        l--;
        for (int i = 0; i < 26; ++i) {
            x -= S[r][i]-S[l][i];
            if(x <= 0){
                printf("%c\n", i+'a');
                break;
            }
        }
    }
    return 0;
}