#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000007;
const int max_size = 100001;
int parent[max_size];
int Size[max_size];
int root(int x) {
  while (x != parent[x]) {
    parent[x] = parent[parent[x]];
    x = parent[x];
  }
  return x;
}
void sunion(int x, int y) {
  int rx = root(x);
  int ry = root(y);
  if (rx != ry) {
    if (Size[rx] > Size[ry]) {
      parent[ry] = parent[rx];
      Size[rx] += Size[ry];
    } else {
      parent[rx] = parent[ry];
      Size[ry] += Size[rx];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    int n, m;
    cin >> n >> m;
    int p[n + 1];
    for (int i = 1; i <= n; i++) cin >> p[i];
    int l, r, x;
    while (m--) {
      cin >> l >> r >> x;
      int v = p[x];
      int cl = 0;
      for (int i = l; i <= r; i++) {
        if (p[i] < v) cl++;
      }
      if (l + cl != x)
        cout << "No\n";
      else
        cout << "Yes\n";
    }
  }
  return 0;
}
