#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int n,m;
int cmp ( const void *a , const void *b )
{
	return *(int *)a - *(int *)b;
}
int main()
{
	freopen ("kth.in","r",stdin);
	freopen ("kth.out","w",stdout);
	cin>>n>>m;
	int q[100002]={0};
	for (int i=1;i<=n;i++)
	{
		cin>>q[i];
	}
	for (int i=0;i<m;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		int w[100002],k=0;
		for (int j=a;j<=b;j++&&k++)
		{
			w[k]=q[j];
		}
		qsort(w,b-a+1,sizeof(w[0]),cmp);
		cout<<w[c-1]<<endl;
	}
	return 0;
}