#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
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){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using Pdi = pair<double, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

struct UnionFind
{
    vector<int> par, sz;
    int n_cc;
    vec S;

    UnionFind(int N){
        par = vector<int>(N);
        REP(i, N) par[i] = i;
        sz = vector<int>(N, 1);
        n_cc = N;

        S = vec(N, -1);
    }

    int find(int x){
        if(par[x] == x) return x;
        else return par[x] = find(par[x]);
    }

    void unite(int x, int y){
        x = find(x);
        y = find(y);
        if(x == y) return;

        if(sz[x] < sz[y]) swap(x, y);

        par[y] = x;
        sz[x] += sz[y];
        if(S[x] == -1 || S[y] == -1) S[x] = -1;
        else S[x] += S[y];
        n_cc--;
    }

    bool is_union(int x, int y){
        x = find(x);
        y = find(y);
        return x == y;
    }

    int union_size(int x){
        return sz[find(x)];
    }

};


signed main(){

    int N, M; cin >> N >> M;
    set<int> x, y;
    //x.insert(0); y.insert(0);
    vec A(N), B(N), C(N);
    REP(i, N){
        cin >> A[i] >> B[i] >> C[i];
        x.insert(A[i]); x.insert(B[i]);
        y.insert(C[i]);
    }
    vec D(M), E(M), F(M);
    REP(i, M){
        cin >> D[i] >> E[i] >> F[i];
        x.insert(D[i]);
        y.insert(E[i]); y.insert(F[i]);
    }

    vec vx(all(x)), vy(all(y));
    int nx = SZ(vx), ny = SZ(vy);

    vector<bools> impx(nx, bools(ny - 1, false));
    vector<bools> impy(ny, bools(nx - 1, false));

    vec a(N), b(N), c(N);
    REP(i, N){
        a[i] = Lower_bound(vx, A[i]); b[i] = Lower_bound(vx, B[i]);
        c[i] = Lower_bound(vy, C[i]);

        FOR(j, a[i], b[i]) impy[c[i]][j] = true;
    }
    vec d(M), e(M), f(M);
    REP(i, M){
        d[i] = Lower_bound(vx, D[i]);
        e[i] = Lower_bound(vy, E[i]); f[i] = Lower_bound(vy, F[i]);

        FOR(j, e[i], f[i]) impx[d[i]][j] = true;
    }

    UnionFind UF((nx + 1) * (ny + 1));
    FOR(i, 1, nx) FOR(j, 1, ny){
        int s = (vx[i] - vx[i - 1]) * (vy[j] - vy[j - 1]);
        UF.S[i * (ny + 1) + j] = s;
    }
    FOR(i, 1, nx){
        FOR(j, 0, ny) if(!impy[j][i - 1]) UF.unite(i * (ny + 1) + j, i * (ny + 1) + j + 1);
    }
    FOR(j, 1, ny){
        FOR(i, 0, nx) if(!impx[i][j - 1]) UF.unite(i * (ny + 1) + j, (i + 1) * (ny + 1) + j);
    }

    int ix = Lower_bound(vx, 0), iy = Lower_bound(vy, 0);
    int ans = UF.S[UF.find(ix * (ny + 1) + iy)];
    Ans(ans >= 0, ans, "INF");

    return 0;
}


Measured memory_bytes: 217312