#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 5;
int a[N];
int dp[N];
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  while (m--) {
    int L, R, x;
    scanf("%d %d %d", &L, &R, &x);
    int val = a[x];
    int pos = (x - L) + 1;
    int cnt = 0;
    for (int i = L; i <= R; i++) {
      if (a[i] <= val) cnt++;
    }
    if (pos == cnt) {
      puts("Yes");
    } else {
      puts("No");
    }
  }
  return 0;
}
