#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int N = 200005;
const double PI = 4 * atan(1);
const long long MAX = 9223372036854775807;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }
bool isprime(long long u) {
  for (long long i = 2; i <= (int)sqrt(u); i++) {
    if (u % i == 0) return 0;
  }
  return 1;
}
long long mod(long long to_mod, long long MOD) {
  to_mod %= MOD;
  while (to_mod < 0) to_mod += MOD;
  return to_mod % MOD;
}
long long moduloMultiplication(long long a, long long b, long long mod) {
  long long res = 0;
  a %= mod;
  while (b) {
    if (b & 1) res = (res + a) % mod;
    a = (2 * a) % mod;
    b >>= 1;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long n, m, x, y, k, z, w, t, l, r, res, ans;
set<long long> ss;
map<long long, vector<long long> > maa;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n >> m;
  ans = 1e18;
  for (int i = 0; i < n; i++) {
    cin >> x;
    ss.insert(x);
    maa[x].push_back(0);
  }
  for (int i = 0; i < m; i++) {
    cin >> x >> y >> z;
    if (x != 1) continue;
    maa[x - 1].push_back(1);
    maa[y].push_back(-1);
    ss.insert(x - 1);
    ss.insert(y);
  }
  res = 0;
  ans = 1e18;
  r = 0;
  if (ss.count(0)) {
    for (auto t : maa[0]) {
      if (t == 1) res++;
      if (t == -1) res--;
    }
    ss.erase(0);
  }
  y = 0;
  ss.insert((long long)1e9);
  maa[(long long)1e9].push_back(0);
  for (auto t : ss) {
    ans = min(ans, res + r);
    for (auto u : maa[t]) {
      if (u == 0) r++;
      if (u == 1) res++;
      if (u == -1) res--;
    }
  }
  if (ss.size()) {
  }
  if (ans < 1e18)
    cout << ans;
  else
    cout << 0;
  return 0;
}
