#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define pb emplace_back
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
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 (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
    ll res = 1; x %= p;
    while (n > 0) {
        if (n & 1) res = res * x % p;
        x = x * x % p;
        n >>= 1;
    }
    return res;
}//x^n%p
ll bitcount(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
constexpr int fn_ = 5000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll m) {
    if (!fact_[0]) {
        fact_[0] = 1; comp_[0] = 1;
        for (int i = 1; i < fn_; i++)
            fact_[i] = fact_[i - 1] * i % m;
        comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], m - 2, m);
        for (int i = fn_ - 2; i > 0; i--)
            comp_[i] = comp_[i + 1] * (i + 1) % m;
    }
    if (x < y) return 0;
    return fact_[x] * comp_[x - y] % m * comp_[y] % m;
}
//--------------------------------------------------------------
short c[5000][5000];//ここは線分か？
bool d[5000][5000];//ここｈ到達可能だったか？
signed main() {
    int n, m;
    cin >> n >> m;
    vec<int>x, y;
    vec<P>a, b;
    x.pb(0); y.pb(0);
    x.pb(-1e10); y.pb(-1e10);
    x.pb(1e10); y.pb(1e10);
    rep(i, n) {
        int u, v, r; cin >> u >> v >> r;
        a.ppp(u, v, r);
        y.pb(r);
        x.pb(u); x.pb(v);
    }
    rep(i, m) {
        int u, v, r; cin >> u >> v >> r;
        b.ppp(u, v, r);
        x.pb(u);
        y.pb(v); y.pb(r);
    }
    crdcomp(x); crdcomp(y);
    rep(i, n) {
        int t = getidx(x, a[i].yy), r = getidx(y, a[i].zz);
        rng(j, getidx(x, a[i].xx), t) {
            c[j][r] = 1;
        }
    }//縦線→左から右とかに通れない
    rep(i, m) {
        int t = getidx(y, b[i].zz), r = getidx(x, b[i].xx);
        rng(j, getidx(y, b[i].yy), t) {
            c[r][j] |= 2;
        }
    }//横線→上から下とかに通れない
    queue<H>q;
    q.push(H{ getidx(x, 0), getidx(y, 0) });
    d[getidx(x, 0)][getidx(y, 0)] = 1;
    while (!q.empty()) {
        H t= q.front(); q.pop();
        if (x[t.fs] == -1e10 || x[t.fs + 1] == 1e10 ||
            y[t.sc] == -1e10 || y[t.sc + 1] == 1e10) {
            cout << "INF\n";
            return 0;
        }
        rep(z, 4) {
            H k = t;
            k.fs += dx[z], k.sc += dy[z];
            if (z == 0 && (c[t.fs][t.sc] & 2)) continue;
            if (z == 1 && (c[t.fs + 1][t.sc] & 2)) continue;
            if (z == 2 && (c[t.fs][t.sc] & 1)) continue;
            if (z == 3 && (c[t.fs][t.sc + 1] & 1)) continue;
            if (!d[k.fs][k.sc]) {
                d[k.fs][k.sc] = 1;
                q.push(H{ k.fs, k.sc });
            }
        }
    }
    int ans = 0;
    rep(i, x.size() - 1)rep(j, y.size() - 1) {
        if (d[i][j]) {
            ans += (x[i + 1] - x[i]) * (y[j + 1] - y[j]);
        }
    }
    cout << ans << endl;
}

Measured memory_bytes: 47092