Destiny CodeForces - 840D（主席树）

Once, Leha found in the left pocket an array consisting of n integers, and in the right pocket q queries of the form l r k. If there are queries, then they must be answered. Answer for the query is minimal x such that x occurs in the interval l r strictly more than times or  - 1 if there is no such number. Help Leha with such a difficult task.

Input

First line of input data contains two integers n and q (1 ≤ n, q ≤ 3·105) — number of elements in the array and number of queries respectively.

Next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ n) — Leha's array.

Each of next q lines contains three integers l, r and k (1 ≤ l ≤ r ≤ n, 2 ≤ k ≤ 5) — description of the queries.

Output

Output answer for each query in new line.

Examples
Input

4 2
1 1 2 2
1 3 2
1 4 2

Output

1
-1

Input

5 3
1 2 1 3 2
2 5 3
1 2 3
5 5 2

Output

2
1
2

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn=300106;
int a[maxn];
int id[maxn];
int root[maxn];
int tot;
int n,m,f=-1;

struct sgt{
	int lc,rc;
	int dat;
}t[maxn*25];

int build(int l,int r){
	int p=++tot;
	t[p].dat=0;
	if(l==r){
		return p;
	}
	int mid=(l+r)/2;
	t[p].lc=build(l,mid);
	t[p].rc=build(mid+1,r);
	return p; 
}

int insert(int now,int l,int r,int x){
	int p=++tot;
	t[p]=t[now];
	t[p].dat++;
	if(l==r) return p;		
	int mid=(l+r)/2;
	if(x<=mid) t[p].lc=insert(t[now].lc,l,mid,x);
	else t[p].rc=insert(t[now].rc,mid+1,r,x);
	return p;
}

int query(int pl,int pr,int l,int r,int k){
	if(l==r) return l;
	int mid=(l+r)/2;
	if(t[t[pr].lc].dat-t[t[pl].lc].dat>k){
		f=query(t[pl].lc,t[pr].lc,l,mid,k);
		if(f!=-1) return f; 
	}
	if(t[t[pr].rc].dat-t[t[pl].rc].dat>k){
		f=query(t[pl].rc,t[pr].rc,mid+1,r,k);
		if(f!=-1) return f; 
	}
	return -1;	
}





int main(){
		int ca;
		tot=0;	
		scanf("%d%d",&n,&m);
		root[0]=build(1,n);		
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			root[i]=insert(root[i-1],1,n,a[i]);
		}
		for(int i=1;i<=m;i++){
			int tl,tr,k;
			scanf("%d%d%d",&tl,&tr,&k);
			printf("%d\n",query(root[tl-1],root[tr],1,n,(tr-tl+1)/k));
		}
	return 0;
}