import sys

def resolve():
    readline = sys.stdin.readline
    n,q = map(int,readline().split())
    cs = [[c] for c in readline().strip()]
    seg = SegTree(cs)
    for _ in range(q):
        l,r,x = map(int,readline().split())
        print(seg.fold(l-1,r)[x-1])

class SegTree:
    """
    reffered to 'maspy', noncommutative operation is available
    X_f = min, X_unit = INF
    X_f = max, X_unit = -INF
    X_f = sum, X_unit = 0
    X_f = lambda _,a,b: a+b, X_unit = ''
    """
    X_f = lambda _,a,b:sorted(a+b)

    def __init__(self, seq):
        l = list(seq)
        self.N = len(l)
        self.X = [[] for _ in range(self.N)] + l
        for i in range(self.N - 1, 0, -1):
            self.X[i] = self.X_f(self.X[i << 1], self.X[i << 1 | 1])

    def set_val(self, i, x):
        i += self.N
        self.X[i] = x
        while i > 1:
            i >>= 1
            self.X[i] = self.X_f(self.X[i << 1], self.X[i << 1 | 1])

    def fold(self, L, R):#[L,R)
        L += self.N
        R += self.N
        vL = []
        vR = []
        while L < R:
            if L & 1:
                vL = self.X_f(vL, self.X[L])
                L += 1
            if R & 1:
                R -= 1
                vR = self.X_f(self.X[R], vR)
            L >>= 1
            R >>= 1
        return self.X_f(vL, vR)


resolve()