#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
vector<int> op(vector<int> a, vector<int> b) {
	vector<int>v(26);
	rep(i, 26) { v[i] = a[i] + b[i]; }
	return v;
}

vector<int> e() {
	vector<int>v(26);
	return v;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q;
	cin >> n >> q;
	string s; cin >> s;
	vector<vector<int>> A(s.size(), vector<int>(26));
	rep(i, s.size()) {
		int num = s[i] - 'a';
		A[i][num] = 1;
	}
	segtree< vector<int>, op, e>seg(A);
	while (q--) {
		int l, r, x;
		cin >> l >> r >> x;
		l--; r--;
		auto v = seg.prod(l, r + 1);
		char ans;
		rep(i, 26) {
			if (x <= v[i]) {
				ans = 'a' + i;
				break;
			}
			else {x -= v[i];}
		}
		cout << ans << endl;
	}
	return 0;
}