// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

bool v[9010][9010];
int col[9010][9010];
int X = 0, Y = 0;

void dfs(int i, int j, int c){
  queue<P> q; q.push(mk(i, j));
  col[i][j] = c;
  while(!q.empty()){
    auto p = q.front(); q.pop();
    rep(k, 4){
      int nx = p.F + dx[k], ny = p.S + dy[k];
      if(nx >= 0 && nx < X && ny >= 0 && ny < Y){
        if(v[nx][ny])continue;
        if(col[nx][ny])continue;
        col[nx][ny] = c;
        q.push(mk(nx, ny));
      }
    }
  }
}

int main(int argc, char const* argv[])
{
  int n, m; cin >> n >> m;
  vector<ll> 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];
  rep(i, n){
    a[i] *= 2;
    b[i] *= 2;
    c[i] *= 2;
  }
  rep(i, m){
    d[i] *= 2;
    e[i] *= 2;
    f[i] *= 2;
  }
  vector<ll> x, y;
  x.pb(0);
  y.pb(0);
  rep(i, n){
    x.pb(a[i] - 1);
    x.pb(a[i]);
    x.pb(a[i] + 1);
    x.pb(b[i] - 1);
    x.pb(b[i]);
    x.pb(b[i] + 1);
    y.pb(c[i] - 1);
    y.pb(c[i]);
    y.pb(c[i] + 1);
  }
  rep(i, m){
    x.pb(d[i] - 1);
    x.pb(d[i]);
    x.pb(d[i] + 1);
    y.pb(e[i] - 1);
    y.pb(e[i]);
    y.pb(e[i] + 1);
    y.pb(f[i] - 1);
    y.pb(f[i]);
    y.pb(f[i] + 1);
  }
  sort(whole(x)); unique(x);
  map<ll, int> mpx;
  rep(i, sz(x))mpx[x[i]] = i;
  sort(whole(y)); unique(y);
  map<ll, int> mpy;
  rep(i, sz(y))mpy[y[i]] = i;

  rep(i, n){
    int yc = mpy[c[i]];
    int xs = mpx[a[i]], xt = mpx[b[i]];
    for(int j = xs; j <= xt; j++)v[j][yc] = true;
  }
  rep(i, m){
    int xc = mpx[d[i]];
    int ys = mpy[e[i]], yt = mpy[f[i]];
    for(int j = ys; j <= yt; j++)v[xc][j] = true;
  }
  X = sz(x), Y = sz(y);
  int nex = 1;
  rep(i, sz(x)){
    rep(j, sz(y)){
      if(v[i][j])continue;
      if(col[i][j])continue;
      dfs(i, j, nex);
      nex++;
    }
  }
  int xz = mpx[0], yz = mpy[0];
  if(col[xz][yz] == 1)cout << "INF" << endl;
  else{
    ll res = 0;
    rep(i, sz(x)){
      rep(j, sz(y)){
        if(col[i][j] == col[xz][yz]){
          ll xl = 0, yl = 0;
          if(x[i] & 1)xl = (x[i+1] - x[i] + 1) / 2;
          else xl = (x[i+1] - x[i]) / 2;
          if(y[j] & 1)yl = (y[j+1] - y[j] + 1) / 2;
          else yl = (y[j+1] - y[j]) / 2;
          res += xl * yl;
        }
      }
    }
    cout << res << endl;
  }
  /*
  cerr << x << endl;
  cerr << y << endl;
  rep(i, sz(x)){
    rep(j, sz(y)){
      cerr << col[i][j];
    }
    cerr << endl;
  }
  */
  return 0;
}


Measured memory_bytes: 391240