#include <bits/stdc++.h>
using namespace std;
int const maxn = (int)2e6 + 1, inf = (int)2e9 + 1;
map<char, int> pidr;
int n, m, ans, cur, sz, a[maxn], b, l[maxn], r[maxn], x[maxn];
bool used[maxn];
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) {
    cin >> l[i] >> r[i] >> x[i];
  }
  for (int i = 1; i <= m; i++) {
    cur = 0;
    for (int j = l[i]; j <= r[i]; j++)
      if (a[j] < a[x[i]]) cur++;
    if (l[i] + cur == x[i])
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
