#include <bits/stdc++.h>
using namespace std;
const int maxn = 10010;
int arr[maxn];
int findsorted(int l, int r, int x, int n) {
  int litter = 0;
  int e = -1;
  for (int i = l; i <= r; i++) {
    if (arr[i] < n) {
      litter++;
    } else if (arr[i] == n) {
      e++;
    }
  }
  if (x >= litter && x <= litter + e) return 1;
  return 0;
}
int main() {
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    for (int i = 1; i <= n; i++) {
      scanf("%d", &arr[i]);
    }
    for (int i = 1; i <= m; i++) {
      int l, r, x;
      scanf("%d%d%d", &l, &r, &x);
      if (findsorted(l, r, x - l, arr[x])) {
        printf("Yes\n");
      } else {
        printf("No\n");
      }
    }
  }
  return 0;
}
