#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

void solve() {
  int n, m;
  cin >> n >> m;
  vi32 a(n), b(n), c(n);
  vi32 d(m), e(m), f(m);
  rep(i, n) {
    cin >> a[i] >> b[i] >> c[i];
  }
  rep(i, m) {
    cin >> d[i] >> e[i] >> f[i];
  }
  set<int> xset, yset;
  xset.insert(0);
  yset.insert(0);
  rep(i, n) {
    xset.insert(a[i]);
    xset.insert(b[i]);
    yset.insert(c[i]);
  }
  rep(i, m) {
    xset.insert(d[i]);
    yset.insert(e[i]);
    yset.insert(f[i]);
  }
  vi32 xo, yo;
  for (auto s : xset) xo.push_back(s);
  for (auto s : yset) yo.push_back(s);
  int h = sz(xo);
  int w = sz(yo);
  vector<vi32> hg(h + 1, vi32(w + 1));
  vector<vi32> wg(h + 1, vi32(w + 1));
  rep(i, n) {
    int ai = lower_bound(all(xo), a[i]) - xo.begin();
    int bi = lower_bound(all(xo), b[i]) - xo.begin();
    int ci = lower_bound(all(yo), c[i]) - yo.begin();
    hg[ai][ci] += 1;
    hg[bi][ci] -= 1;
  }
  rep(j, w) reps(i, h) {
    hg[i][j] += hg[i - 1][j];
  }
  rep(i, m) {
    int di = lower_bound(all(xo), d[i]) - xo.begin();
    int ei = lower_bound(all(yo), e[i]) - yo.begin();
    int fi = lower_bound(all(yo), f[i]) - yo.begin();
    wg[di][ei] += 1;
    wg[di][fi] -= 1;
  }
  rep(i, h) reps(j, w) {
    wg[i][j] += wg[i][j - 1];
  }
  vector<vi32> seen(h, vi32(w));
  using P = pair<int, int>;
  queue<P> q;
  {
    int ox = lower_bound(all(xo), 0) - xo.begin();
    int oy = lower_bound(all(yo), 0) - yo.begin();
    q.emplace(ox, oy);
    if (ox > 0) q.emplace(ox - 1, oy);
    if (oy > 0) q.emplace(ox, oy - 1);
    if (ox > 0 && oy > 0) q.emplace(ox - 1, oy - 1);
  }
  while (sz(q)) {
    int x, y;
    tie(x, y) = q.front();
    q.pop();
    if (seen[x][y]) continue;
    seen[x][y] = 1;
    do {
      // up
      if (wg[x][y]) break;
      if (x == 0) { cout << "INF" << endl; exit(0); }    
      q.emplace(x - 1, y);
    } while (0);
    do {
      // down
      if (wg[x + 1][y]) break;
      if (x + 1 >= h - 1) { cout << "INF" << endl; exit(0); }
      q.emplace(x + 1, y);
    } while (0);
    do {
      // left
      if (hg[x][y]) break;
      if (y == 0) { cout << "INF" << endl; exit(0); }
      q.emplace(x, y - 1);
    } while (0);
    do {
      // right
      if (hg[x][y + 1]) break;
      if (y + 1 >= w - 1) { cout << "INF" << endl; exit(0); }
      q.emplace(x, y + 1);
    } while (0);
  }
  i64 ans = 0;
  rep(i, h - 1) rep(j, w - 1) {
    if (seen[i][j]) {
      ans += (i64) (xo[i + 1] - xo[i]) * (yo[j + 1] - yo[j]);
    }
  }
  cout << ans << endl;
}


Measured memory_bytes: 109860