You are given array a with n integers and m queries. The i-th query is given with three integers li, ri, xi.
For the i-th query find any position pi (li ≤ pi ≤ ri) so that api ≠ xi.
Input
The first line contains two integers n, m (1 ≤ n, m ≤ 2·105) — the number of elements in a and the number of queries.
The second line contains n integers ai (1 ≤ ai ≤ 106) — the elements of the array a.
Each of the next m lines contains three integers li, ri, xi (1 ≤ li ≤ ri ≤ n, 1 ≤ xi ≤ 106) — the parameters of the i-th query.
Output
Print m lines. On the i-th line print integer pi — the position of any number not equal to xi in segment [li, ri] or the value - 1 if there is no such number.
Examples
Input
6 4 1 2 1 1 3 5 1 4 1 2 6 2 3 4 1 3 4 2
Output
2 6 -1 4
从右往左使各个区间左右端点值不相同,预处理出来,因为一个区间左右不同,即可以与x比较,只两者就可以确定答案
#include<bits/stdc++.h>
using namespace std;
int b[600000];
int a[600000];
int main()
{
int n,q;
while(scanf("%d%d",&n,&q)!=EOF)
{
memset(b,0,sizeof(b));
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
}
int maxx=n;//目的是让左区间不等于右区间值;
for(int i=n-1; i>=1; i--)
{
if(a[i]==a[maxx])continue;
else
{
for(int j=maxx; j>i; j--)
{
b[j]=i;//找到不等于 “最右”的数进行更新;
}
}
maxx=i;//更新maxx值;
}
while(q--)
{
int l,r,c;
scanf("%d%d%d",&l,&r,&c);
if(l==r||a[r]!=c)
{
if(a[r]!=c) printf("%d\n",r);
else printf("-1\n");
continue;
}
if(b[r]!=0&&b[r]>=l&&a[b[r]]!=c)
{
printf("%d\n",b[r]);//b[r]是位置;
}
else printf("-1\n");
}
}
}