#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, Q;
	cin >> N >> Q;
	string S;
	cin >> S;
	vector cnt(26, vector<int>(N + 1));
	REP(i, 26) REP(j, N) cnt[i][j + 1] += cnt[i][j] + (S[j] - 'a' == i); // [0, i) [0-indexed]
	while (Q--) {
		int L, R, X;
		scanf("%d %d %d", &L, &R, &X);
		--L; --X;
		int c = 0;
		while (X >= 0) {
			X -= cnt[c][R] - cnt[c][L];
			++c;
		}
		printf("%c\n", c - 1 + 'a');
	}
	
}