#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using str = string;
const char nl = '\n';
;
str to_string(char c) { return str(1, c); }
str to_string(bool b) { return b ? "true" : "false"; }
str to_string(const char* second) { return (str)second; }
str to_string(str second) { return second; }
template <class A>
str to_string(complex<A> c) {
  stringstream ss;
  ss << c;
  return ss.str();
}
str to_string(vector<bool> v) {
  str res = "{";
  for (int i = 0; i < v.size(); i++) res += char('0' + v[i]);
  res += "}";
  return res;
}
template <size_t SZ>
str to_string(bitset<SZ> b) {
  str res = "";
  for (int i = 0; i < b.size(); i++) res += char('0' + b[i]);
  return res;
}
template <class A, class B>
str to_string(pair<A, B> p);
template <class T>
str to_string(T v) {
  bool fst = 1;
  str res = "{";
  for (const auto& x : v) {
    if (!fst) res += ", ";
    fst = 0;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <class A, class B>
str to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
void DBG() { cerr << "]" << endl; }
template <class H, class... T>
void DBG(H h, T... t) {
  cerr << to_string(h);
  if (sizeof...(t)) cerr << ", ";
  DBG(t...);
}
int n, m;
vector<pair<int, pii>> horz;
vector<int> vert;
signed main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  vert = vi(n);
  for (int i = 0; i < n; i++) {
    cin >> vert[i];
  }
  sort(vert.begin(), vert.end());
  horz.resize(m);
  for (int i = 0; i < m; i++) {
    cin >> horz[i].second.first >> horz[i].second.second >> horz[i].first;
  }
  sort(horz.begin(), horz.end());
  vi hoars;
  int last = -1;
  int cur = 0;
  bool bad = 0;
  0;
  for (int i = 0; i < m; i++) {
    if (last == horz[i].first) {
      if (horz[i - 1].second.second == horz[i].second.first) {
        cur = horz[i].second.second;
      } else if (!bad) {
        bad = 1;
        hoars.push_back(horz[i - 1].second.second);
      }
    } else {
      if (!bad) hoars.push_back(cur);
      bad = 0;
      cur = 0;
      if (horz[i].second.first != 1) {
        0;
        bad = 1;
      } else {
        cur = horz[i].second.second;
      }
    }
    last = horz[i].first;
  }
  if (!bad) hoars.push_back(cur);
  0;
  sort(hoars.begin(), hoars.end());
  int ans = 1e9;
  for (int i = n - 1; i >= 0; i--) {
    int x = lower_bound(hoars.begin(), hoars.end(), vert[i]) - hoars.begin();
    0;
    ans = min(ans, (int)hoars.size() - x + i);
  }
  int x = lower_bound(hoars.begin(), hoars.end(), (int)1e9) - hoars.begin();
  ans = min(ans, n + (int)hoars.size() - x);
  cout << ans << nl;
}
