#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(11);
  int T;
  T = 1;
  while (T--) solve();
}

vector<vector<int> > table(6005, vector<int>(6005));
// 書き方の参考, コメントアウトした部分
// https://atcoder.jp/contests/abc168/submissions/13357090
void solve() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n), b(n), c(n), 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];

  vector<int> y;
  {
    set<int> s;
    s.insert(0);
    s.insert(-inf);
    s.insert(inf);

    rep(i, n) {
      s.insert(a[i]);
      s.insert(b[i]);
    }
    rep(i, m) s.insert(d[i]);
    for (auto e : s) y.eb(e);
  }

  vector<int> x;
  {
    set<int> s;
    s.insert(0);
    s.insert(-inf);
    s.insert(inf);

    rep(i, m) {
      s.insert(e[i]);
      s.insert(f[i]);
    }
    rep(i, n) s.insert(c[i]);
    for (auto e : s) x.eb(e);
  }
  // cerr << x << endl << y << endl;

  // 座標間をマスとして
  // INF 外枠に到達できる
  rep(i, n) {
    if (a[i] > b[i]) swap(a[i], b[i]);
    int l = lb(y, a[i]), r = lb(y, b[i]);
    int x_ = lb(x, c[i]);
    // cerr << "l r x_ " << l << " " << r << " " << x_ << endl;
    for (int j = 2 * l; j <= 2 * r; ++j) { // 変えた
      table[j][2 * x_] = 1;
    }
  }
  rep(i, m) {
    if (e[i] > f[i]) swap(e[i], f[i]);
    int l = lb(x, e[i]), r = lb(x, f[i]);
    int y_ = lb(y, d[i]);
    for (int j = 2 * l; j <= 2 * r; ++j) {
      table[2 * y_][j] = 1;
    }
  }
  // rep(i, 15) { rep(j, 15) cerr << table[i][j] << " "; cout << endl; }

  ll ans = 0;
  queue<pii> q;
  q.emplace(2 * lb(y, 0), 2 * lb(x, 0)); // push to emplace

  int dy[] = {0, 1, 0, -1};
  int dx[] = {1, 0, -1, 0};
  while (!q.empty()) {
    int y_, x_;
    tie(y_, x_) = q.front();
    q.pop();

    if (y_ == 0 || x_ == 0 || y_ == 6004 || x_ == 6004) {
      cout << "INF" << endl;
      return;
    }

    if (y_ % 2 && x_ % 2) { // 座標間
      ans += 1LL * (y[y_ / 2 + 1] - y[y_ / 2]) * (x[x_ / 2 + 1] - x[x_ / 2]);
    }

    rep(k, 4) {
      int ny = y_ + dy[k];
      int nx = x_ + dx[k];
      if (table[ny][nx]) continue;
      table[ny][nx] = 2;
      q.emplace(ny, nx);
    }
  }
  cout << ans << endl;
}


Measured memory_bytes: 144816