#include <bits/stdc++.h>
using namespace std;
void read(vector<long long>& c, long long size) {
  for (int i = 0; i < size; i++) {
    int q;
    scanf("%d", &q);
    c.push_back(q);
  }
}
class Bit {
  map<int, int> vals;
};
bool check(vector<long long>& a, long long s, long long k, long long& ans) {
  if (k > a.size()) {
    return false;
  }
  vector<long long> b = a;
  for (int i = 0; i < b.size(); i++) {
    b[i] = b[i] + (i + 1) * k;
  }
  sort(b.begin(), b.end());
  long long sum = 0;
  for (int i = 0; i < k; i++) {
    sum = sum + b[i];
  }
  ans = sum;
  return sum <= s;
}
int main() {
  long long m, n;
  long long t;
  long long i, j;
  long long s;
  vector<long long> a;
  cin >> n >> m;
  read(a, n);
  while (m--) {
    int l, r, x;
    cin >> l >> r >> x;
    l--;
    r--;
    x--;
    int k = 0;
    for (i = l; i <= r; i++) {
      if (a[i] < a[x]) {
        k++;
      }
    }
    if (k == x - l) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
}
