#include<cstdio>
#include<cstring>
#include<cstdlib>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;
#define N 100000
typedef struct node
{
int x, id; //用伴随数组解决
}t;
t node[N];
bool Cmpare(const t &a, const t &b) //const必须加,不然会错,目前不懂为啥。当return的是ture时,a先输出,所以示例中是升序
{
return a.x < b.x; //结构体数组用sort必须加上cmpare判断
}
int main()
{
int n, i, sub;
int left, mid ,right;
while (~scanf("%d%d",&n,&sub)){
for (i = 0; i < n; i++){
cin>>node[i].x;
node[i].id = i;
}
sort(node,node+n,Cmpare); //结构体数组排序
while(sub--){
cin>>left>>right>>mid;
left--;
right--;
for (i = 0; i < n; i++){
if (node[i].id>=left && node[i].id<=right){
mid--;
}
if (!mid){
printf("%d\n",node[i].x);
break;
}
}
}
}
return 0;
}
#include<cstring>
#include<cstdlib>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;
#define N 100000
typedef struct node
{
int x, id; //用伴随数组解决
}t;
t node[N];
bool Cmpare(const t &a, const t &b) //const必须加,不然会错,目前不懂为啥。当return的是ture时,a先输出,所以示例中是升序
{
return a.x < b.x; //结构体数组用sort必须加上cmpare判断
}
int main()
{
int n, i, sub;
int left, mid ,right;
while (~scanf("%d%d",&n,&sub)){
for (i = 0; i < n; i++){
cin>>node[i].x;
node[i].id = i;
}
sort(node,node+n,Cmpare); //结构体数组排序
while(sub--){
cin>>left>>right>>mid;
left--;
right--;
for (i = 0; i < n; i++){
if (node[i].id>=left && node[i].id<=right){
mid--;
}
if (!mid){
printf("%d\n",node[i].x);
break;
}
}
}
}
return 0;
}