#include <bits/stdc++.h>
using namespace std;

// template {{{
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod   = 1e9 + 7;
constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { 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 <typename T1, typename T2> ostream &operator<<(ostream &os, 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> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}

// union find {{{
class union_find {

    using data_type = int_fast32_t;
    std::vector< data_type > data_;

    public:
    union_find(std::size_t size) : data_(size, -1) {}

    std::size_t size() const {
        return data_.size();
    }

    data_type get_root(data_type x) {
        return (data_[x] < 0 ? x : data_[x] = get_root(data_[x]));
    }

    bool is_root(data_type x) {
        return x == get_root(x);
    }

    bool is_same(data_type x, data_type y) {
        return get_root(x) == get_root(y);
    }

    void unite(data_type x, data_type y) {
        x = get_root(x); y = get_root(y);
        if (x == y) return;

        if (data_[x] > data_[y]) std::swap(x, y);
        data_[x] += data_[y];
        data_[y] = x;
    }

    data_type element_count(data_type x) {
        return -data_[get_root(x)];
    }
};
// }}}

void solver() {
    int n = input(), m = input();

    vector< i64 > xs, ys; 
    xs.push_back(-inf);
    xs.push_back(0);
    xs.push_back(inf);

    ys.push_back(-inf);
    ys.push_back(0);
    ys.push_back(inf);

    vector< i64 > as(n), bs(n), cs(n);
    range(i, 0, n) {
        cin >> as[i] >> bs[i] >> cs[i];
        xs.push_back(as[i]);
        xs.push_back(bs[i]);
        ys.push_back(cs[i]);
    }

    vector< i64 > ds(m), es(m), fs(m);
    range(i, 0, m) {
        cin >> ds[i] >> es[i] >> fs[i];
        xs.push_back(ds[i]);
        ys.push_back(es[i]);
        ys.push_back(fs[i]);
    }

    whole(sort, xs);
    whole(sort, ys);

    xs.erase(whole(unique, xs), xs.end());
    ys.erase(whole(unique, ys), ys.end());

    map< i64, i64 > xp, yp;
    range(i, 0, xs.size()) {
        xp[xs[i]] = i;
    }
    range(i, 0, ys.size()) {
        yp[ys[i]] = i;
    }

    auto area = make_vector(xs.size(), ys.size(), infll);
    range(i, 1, (int)xs.size() - 2) {
        range(j, 1, (int)ys.size() - 2) {
            area[i][j] = (xs[i + 1] - xs[i]) * (ys[i + 1] - ys[i]);
        }
    }

    union_find uf(xs.size() * ys.size());

    vector< int > xidx(n);
    range(i, 0, n) xidx[i] = i;

    whole(sort, xidx, [&](int a, int b) { return as[a] < as[b]; });

    int idx = 0;
    using P = pair< int, int >;
    priority_queue< P, vector< P >, greater< P > > pq;

    range(i, 0, xs.size()) {
        while (idx < xidx.size() && xp[as[xidx[idx]]] == i) {
            pq.emplace(bs[xidx[idx]], cs[xidx[idx]]);
            idx++;
        }
        while (!pq.empty() && xp[pq.top().first] == i) {
            pq.pop();
        }

        vector< P > u;
        while (!pq.empty()) {
            u.emplace_back(pq.top());
            pq.pop();
        }

        vector< int > cut;
        for (auto p: u) {
            cut.emplace_back(yp[p.second]); 
            pq.emplace(p);
        }


        whole(sort, cut);
        int idx2 = 0;
        range(j, 0, ys.size()) {
            if (idx2 < cut.size() && cut[idx2] - 1 == j) {
                idx2++;
                continue;
            }
            uf.unite(i * ys.size() + j, i * ys.size() + j + 1);
        }
    }

    idx = 0;
    pq = priority_queue< P, vector< P >, greater< P > >();

    vector< int > yidx(m);
    range(j, 0, m) yidx[j] = j;

    whole(sort, yidx, [&](int a, int b) { return es[a] < es[b]; });

    range(j, 0, ys.size()) {
        while (idx < yidx.size() && yp[es[yidx[idx]]] == j) {
            pq.emplace(fs[yidx[idx]], ds[yidx[idx]]);
            idx++;
        }
        while (!pq.empty() && yp[pq.top().first] == j) {
            pq.pop();
        }


        vector< P > u;
        while (!pq.empty()) {
            u.emplace_back(pq.top());
            pq.pop();
        }

        vector< int > cut;
        for (auto p: u) {
            cut.emplace_back(yp[p.second]);
            pq.emplace(p);
        }

        whole(sort, cut);
        int idx2 = 0;
        range(i, 0, xs.size()) {
            if (idx2 < cut.size() && cut[idx2] - 1 == i) {
                idx2++;
                continue;
            }
            uf.unite(i * ys.size() + j, (i + 1) * ys.size() + j);
        }
    }

    i64 ans = 0;
    int zero = xp[0] * ys.size() + yp[0];
    range(i, 0, xs.size()) range(j, 0, ys.size()) {
        if (!uf.is_same(zero, i * ys.size() + j)) continue;
        if (area[i][j] == infll) {
            cout << "INF" << endl;
            return;
        }

        ans += area[i][j];
    }

    cout << ans << endl;
}

signed main(int argc, char *argv[]) {
    solver();
}
