#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep1(i,n) for (int i=1; i<(int)(n); ++i)
#define repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n); ++i)
#define rrep(i,n) for (int i=(int)(n)-1; i>=0; --i)
#define rrep1(i,n) for (int i=(int)(n)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T> using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"}; // {" ", "\n"}

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
 
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
 
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

long long modpow(int a, long long n, int mod = MOD) { long long ret = 1; do { if (n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
template<typename T1, typename T2> bool CompareByInverse(pair<T1, T2> a, pair<T1, T2> b) { return a.first != b.first ? a.first < b.first : a.second > b.second; }


/* -------- <templates end> -------- */


void solve() {
  int n, m; cin >> n >> m;
  Graph<int> vrt, hrz;
  rep(i,n) {
    int a, b, c; cin >> a >> b >> c;
    vrt.emplace_back(vi{c, a, b});
  }
  rep(j,m) {
    int d, e, f; cin >> d >> e >> f;
    hrz.emplace_back(vi{d, e, f});
  }

  sort(ALL(vrt)), sort(ALL(hrz));

  vi vc, hc;
  rep(i,n) {
    vc.emplace_back(vrt[i][0]);
    hc.emplace_back(vrt[i][1]);
    hc.emplace_back(vrt[i][2]);
  }
  rep(j,m) {
    hc.emplace_back(hrz[j][0]);
    vc.emplace_back(hrz[j][1]);
    vc.emplace_back(hrz[j][2]);
  }

  sort(ALL(vc));
  vc.erase(unique(ALL(vc)), vc.end());
  sort(ALL(hc));
  hc.erase(unique(ALL(hc)), hc.end());

  auto vget = [&](int v) -> int {
    auto itr = lower_bound(ALL(vc), v);
    return 2 * (itr - vc.begin()) - (*itr != v);
  };
  auto hget = [&](int v) -> int {
    auto itr = lower_bound(ALL(hc), v);
    return 2 * (itr - hc.begin()) - (*itr != v);
  };

  int Xmax = 2 * (vc.size() - 1);
  int Ymax = 2 * (hc.size() - 1);

  Graph<bool> seen(Xmax + 1, vb(Ymax + 1, false));
  int prev;
  rep(i,n) {
    int x = vget(vrt[i][0]);
    if (i && vrt[i][0] == vrt[i-1][0]) {
      int fin = hget(vrt[i][2]);
      REP(y, max(prev + 1, hget(vrt[i][1])), fin) {
        seen[x][y] = true;
      }
      chmax(prev, fin);
    } else {
      prev = hget(vrt[i][2]);
      REP(y, hget(vrt[i][1]), prev) {
        seen[x][y] = true;
      }
    }
  }
  rep(j,m) {
    int y = hget(hrz[j][0]);
    if (j && hrz[j][0] == hrz[j-1][0]) {
      int fin = vget(hrz[j][2]);
      REP(x, max(prev + 1, vget(hrz[j][1])), fin) {
        seen[x][y] = true;
      }
      chmax(prev, fin);
    } else {
      prev = vget(hrz[j][2]);
      REP(x, vget(hrz[j][1]), prev) {
        seen[x][y] = true;
      }
    }
  }

  queue<pii> q;
  q.emplace(vget(0), hget(0));
  seen[vget(0)][hget(0)] = true;

  ll ans = 0;

  while (!q.empty()) {
    int x, y;
    tie(x, y) = q.front(); q.pop();

    if (x == 0 || x == Xmax || y == 0 || y == Ymax) {
      cout << "INF\n";
      return;
    }

    if (x & y & 1) {
      ans += 1LL * (vc[(x+1)>>1] - vc[x>>1]) * (hc[(y+1)>>1] - hc[y>>1]);
    }

    rep(i,4) {
      if (!seen[x + dx[i]][y + dy[i]]) {
        q.emplace(x + dx[i], y + dy[i]);
        seen[x + dx[i]][y + dy[i]] = true;
      }
    }
  }

  cout << ans << endl;
}


/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}


Measured memory_bytes: 8224