// May this submission get accepted
#include <bits/stdc++.h>

// エイリアス
using  ll = long signed long;
using ull = long unsigned long;
using  ld = long double;
using namespace std;

// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif

// エイリアス (補完・コンパイルが重くなる)
// #include <boost/multiprecision/cpp_int.hpp>
// using mll = boost::multiprecision::cpp_int;

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
#define FOREACH(i,q) for (auto &i : q)
template<class T> bool chmax(T &a, const T b) { if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T b) { if (a > b) {a = b; return true;} return false; }
constexpr int INF = numeric_limits<int>::max();
constexpr long long LINF = numeric_limits<long long>::max();
constexpr long double EPS = 1e-10L;
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define IIF(q,t,f) ((q) ? (t) : (f))
#define DUMP(q) DUMP_FUNC(q, #q, __FILE__, __LINE__)
template <typename T> void DUMP_PROC(T x) { if (is_integral<T>() || is_floating_point<T>()) cerr << "\e[32m" << x << "\e[m"; else cerr << x; }
template<> void DUMP_PROC<char>(char x) { cerr << "\e[36m\'" << x << "\'\e[m"; }
template<> void DUMP_PROC<string>(string x) { cerr << "\e[33m\"" << x << "\"\e[m"; }
template <typename T, typename U> void DUMP_PROC(pair<T, U> x) { cerr << "{"; DUMP_PROC(x.first); cerr << ", "; DUMP_PROC(x.second); cerr << "}"; }
template <typename ...T, typename U, U... Seq> void DUMP_PROC(tuple<T...> &x, integer_sequence<U, Seq...>) { (void)(int[]){(cerr << ((const char*[]){"", ", "})[!!Seq] << (DUMP_PROC(get<Seq>(x)), ""), 0)...}; }
template <typename ...T> void DUMP_PROC(tuple<T...> x) {cerr << "{"; DUMP_PROC(x, index_sequence_for<T...>()); cerr << "}";}
template <typename T> void DUMP_PROC(vector<T> x) { cerr << "["; for (auto &xi : x) { DUMP_PROC(xi); cerr << (&xi != &*x.rbegin()?", ":""); } cerr << "]"; }
template <typename T> void DUMP_FUNC(T x, const char* name, const char* fn, int ln) { cerr << "\e[32m[DEBUG]\e[m " << name << ": "; DUMP_PROC(x); cerr << " @ " << fn << "(" << ln << ")" << endl; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// 標準入出力
struct qin { // query input
    size_t sz;
    qin(size_t _sz = 1) : sz(_sz) {}
    template <typename T> operator T () const { T a; cin >> a; return a; }
    template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }
    template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }
};
qin in1; // input one
template <typename T> void say(const T x, const char* end = "\n") { cout << x << end; }
void say(const ld x, const char* end = "\n") { cout << setprecision(30) << x << end; }
template <typename T> void say(const vector<T> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { cout << x[i] << (i+1 == i_len ? end : sep); } }
template <typename T> void say(const vector<vector<T>> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { say(x[i], sep, end); } }

// モジュール
// [[LIBRARY]]

// 処理内容
int main() {
    
    ios::sync_with_stdio(false); // stdioを使うときはコメントアウトすること
    cin.tie(nullptr);            // インタラクティブ問題ではコメントアウトすること
    
    ll n, m; cin >> n >> m;
    vector<tuple<ll, ll, ll>> abc, def;
    vector<ll> xs, ys;
    REP(i, n) {
        ll a, b, c; cin >> a >> b >> c;
        abc.emplace_back(a, b, c);
        xs.push_back(a);
        xs.push_back(b);
        ys.push_back(c);
    }
    REP(i, m) {
        ll d, e, f; cin >> d >> e >> f;
        def.emplace_back(d, e, f);
        xs.push_back(d);
        ys.push_back(e);
        ys.push_back(f);
    }
    
    UNIQUE(xs);
    UNIQUE(ys);


    vector<ll> cs, ds;
    REP(i, n) cs.push_back(get<2>(abc[i]));
    REP(i, m) ds.push_back(get<0>(def[i]));
    UNIQUE(cs);
    UNIQUE(ds);
    FOREACH(c, cs) ys.push_back(c);
    FOREACH(d, ds) xs.push_back(d);
    sort(ALL_OF(xs));
    sort(ALL_OF(ys));

    vector psbl(ys.size()-1, vector(xs.size()-1, false));
    vector vist(ys.size()-1, vector(xs.size()-1, false));
    REP(xx, n) {
        ll a, b, c; tie(a, b, c) = abc[xx];
        ll ja = lower_bound(ALL_OF(xs), a) - xs.begin();
        ll jb = upper_bound(ALL_OF(xs), b) - xs.begin() - 1;
        ll i  = lower_bound(ALL_OF(ys), c) - ys.begin();
        RANGE(j, ja, jb-1) psbl[i][j] = true;
    }
    REP(xx, m) {
        ll d, e, f; tie(d, e, f) = def[xx];
        ll j   = lower_bound(ALL_OF(xs), d) - xs.begin();
        ll i_e = lower_bound(ALL_OF(ys), e) - ys.begin();
        ll i_f = upper_bound(ALL_OF(ys), f) - ys.begin() - 1;
        RANGE(i, i_e, i_f-1) psbl[i][j] = true;
    }

    if (0 <= xs.front() || 0 <= ys.front() || xs.back() <= 0 || ys.back() <= 0) {
        say("INF");
        return 0;
    }
    
    ll ic = lower_bound(ALL_OF(ys), 0) - ys.begin();
    ll jc = lower_bound(ALL_OF(xs), 0) - xs.begin();

    deque<pair<ll, ll>> q = {{ic, jc}};
    vist[ic][jc] = true;
    while (q.size()) {
        auto [i, j] = q.front(); q.pop_front();
        if (i-1 >= 0 && !psbl[i-1][j] && !vist[i-1][j]) {
            vist[i-1][j] = true;
            q.emplace_back(i-1, j);
        }
        if (j-1 >= 0 && !psbl[i][j-1] && !vist[i][j-1]) {
            vist[i][j-1] = true;
            q.emplace_back(i, j-1);
        }
        if (i+1 < ys.size()-1 && !psbl[i+1][j] && !vist[i+1][j]) {
            vist[i+1][j] = true;
            q.emplace_back(i+1, j);
        }
        if (j+1 < xs.size()-1 && !psbl[i][j+1] && !vist[i][j+1]) {
            vist[i][j+1] = true;
            q.emplace_back(i, j+1);
        }
    }
    ll ans = 0;
    REP(i, ys.size()-1) REP(j, xs.size()-1) {
        if (ans == LINF) break;
        if (vist[i][j]) {
            if (!i || !j || i == ys.size()-2 || j == xs.size()-2) {
                ans = LINF;
                break;
            } else {
                ans += (ys[i+1] - ys[i]) * (xs[j+1] - xs[j]);
            }
        }
    }
    say(ans == LINF ? "INF"s : to_string(ans));

    REP(j, psbl[0].size()) REP(i, psbl.size()) {
        if (i == ic & j == jc) {
            cerr << "8";
        } else if (vist[i][j]) {
            cerr << "!";
        } else {
            cerr << ".#"[psbl[i][j]];
        }
        if (i+1==i_len) {
            cerr << "\n";
        }
    }
    
}