#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << "]";
}
template <typename A, typename B>
istream &operator>>(istream &cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
const long long MAXN = 1e5 + 7;
long long cnt[MAXN], x[MAXN];
long long n, m;
void check() {
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) cin >> x[i];
  sort(x + 1, x + n + 1);
  x[n + 1] = 1e9;
  long long l, r, y;
  for (long long i = 1; i <= m; i++) {
    cin >> l >> r >> y;
    if (l != 1) continue;
    long long p1 = lower_bound(x, x + n + 2, l - 1) - x;
    long long p2 = upper_bound(x, x + n + 2, r) - x;
    cnt[p1]++;
    cnt[p2]--;
  }
  long long ans = 1e18;
  long long cur = 0;
  for (long long i = 0; i <= n + 1; i++) {
    cur += cnt[i];
    if (i) ans = min(ans, cur + i - 1);
  }
  cout << ans << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    check();
  }
  return 0;
}
