#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e9 + 7;
const long long mod = 1e9 + 7;
const long long maxn = 1e4 + 7;
int a, b;
int s[maxn];
int main() {
  scanf("%d%d", &a, &b);
  for (int i = 0; i < a; i++) scanf("%d", &s[i]);
  int l, r, xx;
  for (int i = 0; i < b; i++) {
    scanf("%d%d%d", &l, &r, &xx);
    set<int> q;
    if (xx > r || xx < l) {
      printf("Yes\n");
      continue;
    }
    int ans = xx - l, sa = s[xx - 1], k = 0;
    for (int j = l - 1; j < r; j++)
      if (s[j] < sa) k++;
    if (ans == k)
      printf("Yes\n");
    else
      printf("No\n");
  }
  return 0;
}
