CF 622 C. Not Equal on a Segment 水吧

C. Not Equal on a Segment

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

#include<cstdio>
#include<cstring>
#include<string>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<utility>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iterator>
#include<stack>
using namespace std;
typedef __int64 LL;
const int INF=1e9+7;
const double eps=1e-7;
const int maxn=2*100000;

int n,m,dp[maxn+10],a[maxn+10];
void pre()
{
    dp[1]=1;
    for(int i=2;i<=n;i++)
    {
        dp[i]=a[i]==a[i-1]?dp[i-1]:i;
    }


}


void work()
{
    int le,ri,x;
    for(int i=1;i<=m;i++)
    {
       scanf("%d%d%d",&le,&ri,&x);
       if(a[ri]!=x)
       {
           printf("%d\n",ri);
           continue;
       }
       int p=dp[ri]-1;

       if(p<le) {puts("-1");continue;}
       printf("%d\n",p);


    }

}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        pre();
        work();
    }
    return 0;
}