#416 Div.2 B

 1 #include <cstdio>
 2 using namespace std;
 3 
 4 const int maxn = 1e4 + 10;
 5 int n, q, a[maxn];
 6 int l, r, p;
 7 
 8 int main(int argc, const char * argv[]) {
 9     scanf("%d%d", &n, &q);
10     for (int i = 1; i <= n; i++) {
11         scanf("%d", &a[i]);
12     }
13     for (int i = 0; i < q; i++) {
14         scanf("%d%d%d", &l, &r, &p);
15         int tmp = 0;
16         for (int j = l; j <= r; j++)  {
17             if (a[j] < a[p]) {
18                 tmp++;
19             }
20         }
21         if (tmp == (p - l)) {
22             printf("Yes\n");
23         } else {
24             printf("No\n");
25         }
26     }
27     return 0;
28 }