#include <iostream>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <set>
#include <algorithm>
#define MAXN 0x7fffffff
using namespace std;
int a[100001],b,c,d,r[100001],l,m,n,x;
int Compare( const void *a , const void *b )
{
	return *(int *)a - *(int *)b;
}

int main(void)
{   
    freopen("kth.in","r",stdin);
    freopen("kth.out","w",stdout);
	scanf("%d%d",&b,&c);
	for (d=0;d<b;d++) scanf("%d",&a[d]);
	for (d=0;d<c;d++)
	{
		scanf("%d%d%d",&l,&m,&n);
		for (x=0;x<=m-l;x++) r[x]=a[l+x-1];
		qsort(r,m-l+1,sizeof(int),Compare);
		printf("%d\n",r[n-1]);
	}
	fclose(stdin);
    fclose(stdout);
    return 0;
}