#pragma region kyopro_template
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
using namespace std;
void solve();
using ll = long long;
template <class T = ll>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ll ceil(T a, U b) {
  return (a + b - 1) / b;
}
constexpr ll TEN(int n) {
  ll ret = 1, x = 10;
  while (n) {
    if (n & 1) ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << " ";
  out(u...);
}
template <typename T>
void die(T x) {
  out(x);
  exit(0);
}

#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...)                   \
  do {                             \
    cerr << #__VA_ARGS__ << " = "; \
    dbg_out(__VA_ARGS__);          \
  } while (0)
#define trca(v, N)       \
  do {                   \
    cerr << #v << " = "; \
    array_out(v, N);     \
  } while (0)
#define trcc(v)                             \
  do {                                      \
    cerr << #v << " = {";                   \
    each(x, v) { cerr << " " << x << ","; } \
    cerr << "}" << endl;                    \
  } while (0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main() { solve(); }
#endif

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

inline int popcnt(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
  a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
  a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
  vector<T> ret(v.size() + 1);
  for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

#pragma endregion

constexpr long long MOD = /**/ 1000000007;  //*/ 998244353;

template <class T>
struct compress {
  vector<T> xs;
  compress(const vector<T> &v) {
    xs.reserve(v.size());
    for (T x : v) xs.push_back(x);
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
  }

  int get(const T &x) {
    return lower_bound(xs.begin(), xs.end(), x) - xs.begin();
  }
  int size() { return xs.size(); }
  T &operator[](int i) { return xs[i]; }
};

void solve() {
  ini(N, M);
  vl a(N), b(N), c(N);
  vl d(M), e(M), f(M);
  in3(a, b, c);
  in3(d, e, f);

  vl X, Y;
  X.pb(-inf);
  X.pb(inf);
  X.pb(0);
  Y.pb(0);
  Y.pb(-inf);
  Y.pb(inf);

  each(x, a) X.pb(x);
  each(x, b) X.pb(x);
  each(x, c) Y.pb(x);
  each(x, d) X.pb(x);
  each(x, e) Y.pb(x);
  each(x, f) Y.pb(x);

  X = mkuni(X);
  Y = mkuni(Y);
  compress<ll> zx(X), zy(Y);

  trc(X, Y);
  vvi g(sz(X) * sz(Y));
  auto idx = [&](int i, int j) { return i * sz(Y) + j; };

  // 禁止辺を入れていく
  rep(i, N) {
    int ia = zx.get(a[i]);
    int ib = zx.get(b[i]);
    int ic = zy.get(c[i]);
    for (int ii = ia; ii < ib; ii++) {
      int u = idx(ii, ic), v = idx(ii, ic - 1);
      g[u].pb(v);
      g[v].pb(u);
    }
  }
  rep(i, M) {
    int ia = zx.get(d[i]);
    int ib = zy.get(e[i]);
    int ic = zy.get(f[i]);
    for (int j = ib; j < ic; j++) {
      int u = idx(ia, j), v = idx(ia - 1, j);
      g[u].pb(v);
      g[v].pb(u);
    }
  }

  d.resize(sz(X) * sz(Y), 0);
  fill(all(d), 0);
  int dx[4] = {0, 1, 0, -1};
  int dy[4] = {1, 0, -1, 0};
  queue<int> Q;
  int start = idx(zx.get(0), zy.get(0));
  d[start] = 1;
  Q.push(start);
  auto ok = [&](int i, int j) {
    return 0 <= i && i < sz(X) && 0 <= j && j < sz(Y);
  };
  while (!Q.empty()) {
    int cur = Q.front();
    Q.pop();
    int i = cur / sz(Y);
    int j = cur % sz(Y);
    rep(dn, 4) {
      int di = i + dx[dn];
      int dj = j + dy[dn];
      if (!ok(di, dj)) continue;
      int id = idx(di, dj);
      if (d[id] == 1) continue;
      int yosi = 1;
      each(nya, g[cur]) if (nya == id) yosi = 0;
      if (!yosi) continue;
      d[id] = 1;
      Q.push(id);
    }
  }

  ll ans = 0;
  rep(i, sz(X)) rep(j, sz(Y)) {
    if (d[idx(i, j)] == 0) continue;
    if (i == 0 || i == sz(X) - 1 || j == 0 || j == sz(Y) - 1) die("INF");
    ans += (X[i + 1] - X[i]) * (Y[j + 1] - Y[j]);
  }

  out(ans);
}

Measured memory_bytes: 473048