Vladik and Complicated Book

Input

First line contains two space-separated integersn,m (1 ≤ n, m ≤ 10⁴) — length of permutation and number of times Vladik's mom sorted some subsegment of the book.

Second line contains n space-separated integersp₁, p₂, ..., p_n (1 ≤ p_i ≤ n) — permutationP. Note that elements in permutation are distinct.

Each of the next m lines contains three space-separated integersl_i,r_i,x_i (1 ≤ l_i ≤ x_i ≤ r_i ≤ n) — left and right borders of sorted subsegment in i-th sorting and position that is interesting to Vladik.

Output

For each mom’s sorting on it’s own line print "Yes", if page which is interesting to Vladik hasn't changed, or "No" otherwise.

Examples

Input

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

Output

Yes
No
Yes
Yes
No

Input

6 5
1 4 3 2 5 6
2 4 3
1 6 2
4 5 4
1 3 3
2 6 3

Output

Yes
No
Yes
No
Yes

Note

Explanation of first test case:

1. [1, 2, 3, 4, 5] — permutation after sorting,3-rd element hasn’t changed, so answer is "Yes".
2. [3, 4, 5, 2, 1] — permutation after sorting,1-st element has changed, so answer is "No".
3. [5, 2, 3, 4, 1] — permutation after sorting,3-rd element hasn’t changed, so answer is "Yes".
4. [5, 4, 3, 2, 1] — permutation after sorting,4-th element hasn’t changed, so answer is "Yes".
5. [5, 1, 2, 3, 4] — permutation after sorting,3-rd element has changed, so answer is "No".

思路:只需判断[l,r]区间内小于x下标的个数count，判断排序后的位置l+count是否等于x即可

result:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

//sort在算法里是排序的意思，注意题意
//判断排序后index.x是不是在中间的位置 只需要判断区间内小于a[x]是不是等于x-l即可
int main()
{
    vector<int> a;
    int n,m,tmp;
    cin>>n>>m;
    for(int i=0;i<n;i++){
        cin>>tmp;
        a.push_back(tmp);
    }
    int l,r,x;
    while(m--){
      cin>>l>>r>>x;
      int count=0;
        for(int i=l-1;i<r;i++)
        {
            if(a[i]<a[x-1])
                count++;
        }
        if(count==x-l) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}