#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define pb emplace_back
#define sz(a) int(a.size())

const int N = 1e5 + 5;
int n, m, s[N], l[N], r[N], x[N], y[N];
vector<int> disc, vec[N];
int d[N], lc[N];
priority_queue<int, vector<int>, greater<int>> Q;

inline int askd(int x) {
  return lower_bound(disc.begin(), disc.end(), x) - disc.begin();
}

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    cin >> s[i] >> l[i] >> r[i], ++r[i];
  }
  disc.pb(1e9 + 1), disc.pb(0);
  for (int i = 1; i <= m; ++i) {
    cin >> x[i] >> y[i];
    disc.pb(x[i] - 1);
  }
  sort(disc.begin(), disc.end());
  disc.erase(unique(disc.begin(), disc.end()), disc.end());
  fill_n(d, sz(disc), int(1e9));
  for (int i = 1; i <= m; ++i) {
    int pos = askd(x[i]);
    d[pos] = min(d[pos], y[i]);
  }
  for (int i = 1; i < sz(disc); ++i) {
    d[i] = min(d[i], d[i - 1]);
  }
  for (int i = 0; i < sz(disc); ++i) {
    d[i] = d[i] - d[i + 1];
  }
  for (int i = 1; i <= n; ++i) {
    vec[askd(r[i])].pb(l[i]);
  }
  int ans = 0;
  for (int i = sz(disc) - 1, sum = 0; ~i; --i) {
    sum += d[i];
    for (auto v : vec[i]) {
      if (sum) {
        ++ans, --sum, Q.emplace(v);
      }else if (sz(Q) && Q.top() < v) {
        int u = Q.top();
        Q.pop(), Q.emplace(v);
        if (u < 0) {
          continue; 
        }
        ++lc[askd(u)];
      }else {
        ++lc[askd(v)];
      }
    }
    while (sum && lc[i]) {
      Q.emplace(-1), --lc[i], --sum;
    }
    ans -= lc[i];
  }
  cout << ans << '\n';
  return 0;
}