#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10010;
int num[MAXN], a[MAXN];
int n;
int work(int l, int r, int x) {
  int v = a[x], tot = 0;
  memset(num, 0, sizeof(num));
  for (int i = l; i <= r; i++) {
    if (a[i] < v) {
      tot++;
    }
  }
  if (l + tot == x) {
    return 1;
  } else {
    return 0;
  }
}
int main() {
  int l, r, x;
  int m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d%d%d", &l, &r, &x);
    if (l == r) {
      cout << "Yes" << endl;
    } else if (work(l, r, x) == 1) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
  return 0;
}
