#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
#include<array>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int,int>;
using piii = pair<pii,int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>inline bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>inline bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void in(void){return;}
template <typename First, typename... Rest> void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}
inline void out(void){cout << "\n";return;}
template <typename First, typename... Rest> void out(First first, Rest... rest){cout << first << " ";out(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
}
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 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class S, class T> pair<S,T> operator*(const pair<S,T> &s, const S& t){return pair<S,T>(s.first*t, s.second*t);}
template <typename T> void Exit(T first){cout << first << endl;exit(0); };
template< int mod > struct ModInt {
    unsigned x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1,0), pii(0, 1), pii(-1, 0), pii(0, -1)};
const int calender[13] = {0, 31,28,31,30,31,30,31,31,30,31,30,31};
const int ucalender[13] = {0, 31,29,31,30,31,30,31,31,30,31,30,31};
bool range(int a, int b, int x){if(a <= x and x < b)return true;else return false;}
bool range(int a, int b, int c, int d, pii p){if(a <= p.first and p.first < b and c <= p.second and p.second < d) return true;else return false;}

template< typename T >
struct Compress {
  vector< T > xs;

  Compress() = default;

  Compress(const vector< T > &vs) {
    add(vs);
  }

  Compress(const initializer_list< vector< T > > &vs) {
    for(auto &p : vs) add(p);
  }

  void add(const vector< T > &vs) {
    copy(begin(vs), end(vs), back_inserter(xs));
  }

  void add(const T &x) {
    xs.emplace_back(x);
  }

  void build() {
    sort(begin(xs), end(xs));
    xs.erase(unique(begin(xs), end(xs)), end(xs));
  }

  vector< int > get(const vector< T > &vs) const {
    vector< int > ret;
    transform(begin(vs), end(vs), back_inserter(ret), [&](const T &x) {
      return lower_bound(begin(xs), end(xs), x) - begin(xs);
    });
    return ret;
  }

  int get(const T &x) const {
    return lower_bound(begin(xs), end(xs), x) - begin(xs);
  }

  const T &operator[](int k) const {
    return xs[k];
  }

  int size(){
      return xs.size();
  }
};
// Compress< long long > comp(A);
// comp.build();
// add(vs): vs内にある座標をすべて追加する
// add(x): 座標 x を追加する
// build(): 構築する
// get(vs): vs内にある座標をそれぞれ座標圧縮したものを返す
// get(x): 座標 x を座標圧縮したものを返す
// [k]:= 座標圧縮後の k が示す実際の座標を返す

struct L{
    int a, b, c;
    L(int a = 0,int b = 0, int c = 0): a(a), b(b), c(c){}
};

int main(){
    iosetup();
    int n, m; cin >> n >> m;
    Compress<int> cpx, cpy;
    vector<L> vh, vl;
    vector<int> xs{0}, ys{0};
    rep(i, 0, n){
        int a, b, c; cin >> a >> b >> c;
        xs.push_back(a);
        xs.push_back(b);
        ys.push_back(c);
        vh.emplace_back(a, b, c);
    }
    rep(i, 0, m){
        int a, b, c; cin >> c >> a >> b;
        ys.push_back(a);
        ys.push_back(b);
        xs.push_back(c);
        vl.emplace_back(a, b, c);
    }
    // cerr << xs << endl;
    cpx.add(xs); cpx.build();
    cpy.add(ys); cpy.build();
    int h = cpx.size() * 2;
    int w = cpy.size() * 2;

    vector<vector<int> > d(h, vector<int>(w, 0));
    // cerr << h << w << endl;
    rep(i, 0, n){
        // cerr << i << endl;
        int a = cpx.get(vh[i].a) * 2;
        int b = cpx.get(vh[i].b) * 2;
        int c = cpy.get(vh[i].c) * 2;
        rep(j, a, b + 1) d[j][c] = -1;
    }
    // cerr << d << endl;
    rep(i, 0, m){
        int a = cpy.get(vl[i].a) * 2;
        int b = cpy.get(vl[i].b) * 2;
        int c = cpx.get(vl[i].c) * 2;
        rep(j, a, b + 1) d[c][j] = -1;
    }
    int X = cpx.get(0) * 2, Y = cpy.get(0) * 2;
    d[X][Y] = 1;
    // cerr << X << endl;
    queue<pii> q;
    q.emplace(X, Y);
    while(!q.empty()){
        auto [x, y] = q.front(); q.pop();
        rep(i, 0, 4){
            int nx  = x + dx[i], ny = y + dy[i];
            if(nx < 0 or nx >= h) continue;
            if(ny < 0 or ny >= w) continue;
            if(d[nx][ny] != 0) continue;
            d[nx][ny] = 1;
            q.emplace(nx, ny);
        }
    }
    // rep(i, 0, h) cerr << d[i] << endl;
    ll ans = 0;
    rep(i, 0, h) rep(j, 0, w) if(d[i][j]==1){
        if(i == 0 or i == h - 1 or j == 0 or j == w - 1) Exit("INF");
        if(i%2==0 or j%2==0) continue;
        ll ex = cpx[i/2+1] - cpx[i/2];
        ll ey = cpy[j/2+1] - cpy[j/2];
        ans += ex * ey;
    }
    cout << ans << endl;



    return 0;
}

Measured memory_bytes: 144680