#include <bits/stdc++.h>
using namespace std;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int yahitohhaionewalavariables(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
bool comparator(int i, int j) { return (i < j); }
long long gcd(long long x, long long y) {
  long long t;
  while (y != 0) {
    t = x % y;
    x = y;
    y = t;
  }
  return x;
}
bool isVowel(char ch) {
  if (ch == 'a' || ch == 'i' || ch == 'e' || ch == 'u' || ch == 'o' ||
      ch == 'y') {
    return true;
  }
  return false;
}
bool isPrime(int n) {
  int root = sqrt(n);
  for (int i = 2; i <= root; i++)
    if (n % i == 0) return 0;
  return 1;
}
using namespace std;
template <typename t>
void f(char* x, t&& val1) {
  cout << x << " : " << val1 << endl;
}
template <typename t1, typename... t2>
void f(char* x, t1&& val1, t2&&... val2) {
  char* xd = strchr(x + 1, ',');
  cout.write(x, xd - x) << " : " << val1 << " | ";
  f(xd + 1, val2...);
}
using namespace std;
long long n, m, pos, x, y, pisos, i, ans, a[200000];
vector<long long> v;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] -= 1;
  }
  sort(a + 1, a + 1 + n);
  if (a[n] < 1000000000 - 2) a[++n] = 1000000000 - 2;
  for (i = 1; i <= m; i++) {
    cin >> x >> y >> pos;
    if (x == 1) v.push_back(y);
  }
  sort(v.begin(), v.end());
  ans = n + m;
  for (i = 1; i <= n; i++) {
    x = a[i];
    pos = upper_bound(v.begin(), v.end(), x) - v.begin();
    ans = min((long long)ans, (long long)(v.size() - pos - 1) + i);
  }
  cout << ans;
  return 0;
}
