#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; }

template <typename T>
struct Compress {
  vector<T> v;
  Compress(vector<T> v) : v(v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
  }
  int get(T x) {
    return lower_bound(v.begin(), v.end(), x) - v.begin();
  }
  int size() {
    return (int) v.size();
  }
  T& operator[](int k) {
    return v[k];
  }
};

int dx[] = {0, -1, 0, 1};
int dy[] = {1, 0, -1, 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];
  }
  auto xc = [&]() {
    vi32 v({(int) -1.1e9, 0, (int) 1.1e9});
    rep(i, n) {
      v.push_back(a[i]);
      v.push_back(b[i]);
    }
    rep(i, m) {
      v.push_back(d[i]);
    }
    return Compress(v);
  }();
  auto yc = [&]() {
    vi32 v({(int) -1.1e9, 0, (int) 1.1e9});
    rep(i, n) {
      v.push_back(c[i]);
    }
    rep(i, m) {
      v.push_back(e[i]);
      v.push_back(f[i]);
    }
    return Compress(v);
  }();
  int h = xc.size();
  int w = yc.size();
  vector<vi32> g(h + 1, vi32(w + 1));
  rep(i, n) {
    int ai = xc.get(a[i]);
    int bi = xc.get(b[i]);
    int ci = yc.get(c[i]);
    repi(j, ai, bi) {
      g[j][ci - 1] |= 1 << 0;
      g[j][ci - 0] |= 1 << 2;
    }
  }
  rep(i, m) {
    int di = xc.get(d[i]);
    int ei = yc.get(e[i]);
    int fi = yc.get(f[i]);
    repi(j, ei, fi) {
      g[di - 1][j] |= 1 << 3;
      g[di - 0][j] |= 1 << 1;
    }
  }
  vector<vi32> seen(h + 1, vi32(w + 1));
  using P = pair<int, int>;
  queue<P> q;
  {
    int ox = xc.get(0);
    int oy = yc.get(0);
    rep(i, 2) rep(j, 2) q.emplace(ox - i, oy - j);
  }
  while (sz(q)) {
    int x, y;
    tie(x, y) = q.front();
    q.pop();
    if (x == 0 || x == h || y == 0 || y == w) {
      cout << "INF" << endl;
      return;
    }
    if (seen[x][y]) continue;
    seen[x][y] = 1;
    rep(i, 4) if (~g[x][y] & (1 << i)) {
      int nx = x + dx[i];
      int ny = y + dy[i];
      q.emplace(nx, ny);
    }
  }
  i64 ans = 0;
  rep(i, h - 1) rep(j, w - 1) {
    if (seen[i][j]) {
      ans += (i64) (xc[i + 1] - xc[i]) * (yc[j + 1] - yc[j]);
    }
  }
  cout << ans << endl;
}
