#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const long double eps = 1e-8;
const int mod = 1e9 + 7;
const int maxn = 3e5 + 100;
const int N = 1e6 + 1000;
const int M = 500 + 10;
const long long mm = (1LL << 32);
template <class T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
  x = f ? -x : x;
}
template <class T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  T y = 1;
  int len = 1;
  for (; y <= x / 10; y *= 10) ++len;
  for (; len; --len, x %= y, y /= 10) putchar(x / y + 48);
}
long long qpow(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
long long c[N];
void add(int x, long long val) {
  while (x <= 1000010) c[x] += val, x += x & (-x);
}
long long sum(int x) {
  long long res = 0;
  while (x) res += c[x], x -= x & (-x);
  return res;
}
struct node {
  int x, y, w;
  bool operator<(const node &b) const { return x < b.x; }
} a[N];
struct line {
  int x, l, r;
  bool operator<(const line &b) const { return x < b.x; }
} b[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  int cnt = 0;
  long long ans = 1;
  for (int i = 1; i <= n; ++i) {
    int y, l, r;
    cin >> y >> l >> r;
    if (l == 0 && r == 1000000) ans++;
    a[++cnt] = node({l + 1, y + 1, 1});
    a[++cnt] = node({r + 2, y + 1, -1});
  }
  for (int i = 1; i <= m; ++i) {
    int x, l, r;
    cin >> x >> l >> r;
    if (l == 0 && r == 1000000) ans++;
    b[i] = line({x + 1, l + 1, r + 1});
  }
  sort(a + 1, a + 1 + cnt);
  sort(b + 1, b + 1 + m);
  int pos = 1;
  for (int i = 1; i <= m; ++i) {
    while (pos <= cnt && a[pos].x <= b[i].x) {
      add(a[pos].y, a[pos].w);
      pos++;
    }
    ans += sum(b[i].r) - sum(b[i].l - 1);
  }
  cout << ans << endl;
  return 0;
}
