#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
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){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

constexpr int INF = 1e9 + 10;

unordered_map<int, int> Z(vector<int> v)
{
    unordered_map<int, int> ret;
    for (auto x : v)
    {
        int n = ret.size();
        ret[x] = n;
    }
    return ret;
}

struct GridUnionFind
{
    int H, W;
    std::vector<int> par, cou;
    using P = std::pair<int, int>;
    GridUnionFind(int H_, int W_) : H(H_), W(W_), par(H * W), cou(H * W, 1) { std::iota(par.begin(), par.end(), 0); }
    inline int id_(int h, int w) { return h * W + w; }
    inline bool coordinate_valid(int h, int w) { return h >= 0 and h < H and w >= 0 and w < W; }
    int _find(int x) { return (par[x] == x) ? x : (par[x] = _find(par[x])); }
    bool _unite(int x, int y) {
        x = _find(x), y = _find(y); if (x == y) return false;
        if (cou[x] < cou[y]) std::swap(x, y);
        par[y] = x, cou[x] += cou[y];
        return true;
    }
    int find(int h, int w) {
        assert(coordinate_valid(h, w));
        return _find(id_(h, w));
    }
    bool unite(int h, int w, int h2, int w2) {
        assert(coordinate_valid(h, w) and coordinate_valid(h2, w2));
        return _unite(id_(h, w), id_(h2, w2));
    }
    int count(int h, int w) { return cou[find(h, w)]; }
    bool same(int h, int w, int h2, int w2) { return find(h, w) == find(h2, w2); }

    int find(P p) { return find(p.first, p.second); }
    bool unite(P p, P p2) { return unite(p.first, p.second, p2.first, p2.second);  }
    int count(P p) { return count(p.first, p.second); }
    bool same(P p, P p2) { return same(p.first, p.second, p2.first, p2.second); }

    void merge_outer() {
        for (int h = 0; h < H - 1; h++) unite(h, 0, h + 1, 0), unite(h, W - 1, h + 1, W - 1);
        for (int w = 0; w < W - 1; w++) unite(0, w, 0, w + 1), unite(H - 1, w, H - 1, w + 1);
    }
    friend std::ostream &operator<<(std::ostream &os, GridUnionFind &g)
    {
        constexpr int WW = 3;
        os << "[(" << g.H << " * " << g.W << " grid)\n";
        for (int i = 0; i < g.H; i++) {
            for (int j = 0; j < g.W - 1; j++) {
                os << std::setw(WW) << g.find(i, j) << (g.same(i, j, i, j + 1) ? '-' : ' ');
            }
            os << std::setw(WW) << g.find(i, g.W - 1) << '\n';
            if (i < g.H - 1) {
                for (int j = 0; j < g.W; j++) os << std::setw(WW + 1) << (g.same(i, j, i + 1, j) ? "| " : "  ");
                os << "\n";
            }
        }
        os << "]\n";
        return os;
    }
};

int main()
{
    int N, M;
    cin >> N >> M;
    vector<int> zx{-INF, 0, INF}, zy{-INF, 0, INF};
    vector<int> A(N), B(N), C(N), D(M), E(M), F(M);
    REP(i, N) cin >> A[i] >> B[i] >> C[i];
    REP(j, M) cin >> D[j] >> E[j] >> F[j];

    zx.insert(zx.end(), ALL(A));
    zx.insert(zx.end(), ALL(B));
    zx.insert(zx.end(), ALL(D));

    zy.insert(zy.end(), ALL(C));
    zy.insert(zy.end(), ALL(E));
    zy.insert(zy.end(), ALL(F));

    sort(ALL(zx));
    zx.erase(unique(ALL(zx)), zx.end());
    sort(ALL(zy));
    zy.erase(unique(ALL(zy)), zy.end());
    unordered_map<int, int> xinv = Z(zx), yinv = Z(zy);

    vector<vector<int>> conn1(zx.size(), vector<int>(zy.size(), 0));
    vector<vector<int>> conn2(zx.size(), vector<int>(zy.size(), 0));
    REP(i, N)
    {
        int x1 = xinv[A[i]], x2 = xinv[B[i]], y = yinv[C[i]];
        conn1[x1][y - 1]++;
        conn1[x2][y - 1]--;
    }
    REP(i, conn1.size() - 1) REP(j, conn1[i].size()) conn1[i + 1][j] += conn1[i][j];

    REP(j, M)
    {
        int x = xinv[D[j]], y1 = yinv[E[j]], y2 = yinv[F[j]];
        conn2[x - 1][y1]++;
        conn2[x - 1][y2]--;
    }
    REP(i, conn2.size()) REP(j, conn2[i].size() - 1) conn2[i][j + 1] += conn2[i][j];

    GridUnionFind uf(zx.size(), zy.size());
    REP(x, zx.size()) REP(y, zy.size())
    {
        if (x + 1 < zx.size() and conn2[x][y] == 0) uf.unite(x, y, x + 1, y);
        if (y + 1 < zy.size() and conn1[x][y] == 0) uf.unite(x, y, x, y + 1);
    }

    int xz = xinv[0], yz = yinv[0];
    // dbg(uf);

    if (uf.same(xz, yz, 0, 0))
    {
        puts("INF");
        return 0;
    }
    lint ret = 0;
    REP(x, zx.size() - 1) REP(y, zy.size() - 1) if (uf.same(x, y, xz, yz))
    {
        ret += 1LL * (zx[x + 1] - zx[x]) * (zy[y + 1] - zy[y]);
    }
    cout << ret << '\n';
}


Measured memory_bytes: 144696