///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define PI  (3.1415926535)

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T>
T get_m(M<TT, T> &m, TT k, T default_value)
{
    if (m.find(k) == m.end()) return m[k] = default_value;
    return m[k];
}

template <typename TT, typename T>
void incr_m(M<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(auto &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

void _debug_print(auto x)
{
    cout << x << endl;
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "-- " << x1 << " -- " << x2
         << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename TT, typename T>
void _debug_print(const M<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}

void _debug_print_time(const char *prefix)
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    struct tm *tm = localtime(&tv.tv_sec);
    printf("-- %s %02d:%02d:%02d.%06ld\n",
           prefix, tm->tm_hour, tm->tm_min, tm->tm_sec, tv.tv_usec);
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

void make_rooms(V<t4> &rooms, const V<t3> &xplist, const V<t3> &yplist,
                ll n, ll m)
{
    debug_printf("---------------- make_rooms\n");

    S priority_queue_incr<t4> q;

    rep (i, n) {
        ll x1 = get<0>(xplist[i]);
        ll x2 = get<1>(xplist[i]);
        ll y = get<2>(xplist[i]);
        q.push(t4(x1, y, 1, i));
        q.push(t4(x2, y, -1, i));
    }
    rep (i, m) {
        ll x = get<0>(yplist[i]);
        ll y1 = get<1>(yplist[i]);
        ll y2 = get<2>(yplist[i]);
        q.push(t4(x, -1e18, 0, i));
    }
    q.push(t4(1e18, 1e18, 0, 1e18));

    S set<t2> borders;
    borders.insert(t2(1e18, 1e18));

    ll prev_x = -1e18;

    while (q.size()) {
        auto item = q.top(); q.pop();
        ll x = get<0>(item);
        ll y_diff = get<1>(item);
        ll type = get<2>(item);
        ll idx = get<3>(item);

        ll prev_y = -1e18;
        for (auto b : borders) {
            ll y = get<0>(b);
            if (prev_x != x) rooms.pb(t4(prev_x, x, prev_y, y));
            prev_y = y;
        }

        if (type == 1) borders.insert(t2(y_diff, idx));
        if (type == -1) borders.erase(t2(y_diff, idx));

        prev_x = x;
    }

    debug_printf("---- rooms\n");
    debug_print(rooms);
}

void make_idxs(V<ll> &idxs, const V<t4> &rooms)
{
    debug_printf("------------------ make_idxs\n");

    ll prev1 = -1e18-1LL;
    ll prev2 = -1e18-1LL;
    rep (i, rooms.size()) {
        ll val1 = get<0>(rooms[i]);
        ll val2 = get<1>(rooms[i]);
        if (prev1 != val1 || prev2 != val2) idxs.pb(i);
        prev1 = val1;
        prev2 = val2;
    }

    idxs.pb(rooms.size());

    debug_printf("---- idxs\n");
    debug_print(idxs);
}

void make_yb(M<ll, V<ll> > &ybs, const V<t3> &yplist)
{
    debug_printf("--------------------- make_yb\n");

    M<ll, priority_queue_incr<t2> > qs;

    for (auto yp : yplist) {
        ll x = get<0>(yp);
        ll y1 = get<1>(yp);
        ll y2 = get<2>(yp);
        if (qs.find(x) == qs.end()) qs[x] = priority_queue_incr<t2>();
        qs[x].push(t2(y1, 1));
        qs[x].push(t2(y2, -1));
    }

    for (auto item : qs) {
        ll x = item.first;
        priority_queue_incr<t2> q = item.second;
        V<ll> tmp;
        ll now = 0;
        while (qs[x].size()) {
            auto yd = qs[x].top(); qs[x].pop();
            ll y = get<0>(yd);
            ll dir = get<1>(yd);
            if (dir == 1 && now == 0) tmp.pb(y);
            if (dir == -1 && now == 1) tmp.pb(y);
            now += dir;
        }

        rep (j, tmp.size()) {
            if (j == tmp.size()-1) {
                ybs[x].pb(tmp[j]);
                continue;
            }
            if (tmp[j] == tmp[j+1]) {
                j++;
                continue;
            }
            ybs[x].pb(tmp[j]);
        }
    }

    debug_printf("---- ybs\n");
    debug_print(ybs);
}

void make_edgelist(V<ll> edgelist[], const V<t4> &rooms,
                   const V<ll> &idxs, const M<ll, V<ll> > &ybs)
{
    debug_printf("-------------- make_edgelist\n");

    rep (ii, idxs.size()-2) {
        ll b1 = idxs[ii];
        ll b2 = idxs[ii+1];
        ll b3 = idxs[ii+2];

        ll x = get<1>(rooms[b1]);
        ll idx1 = b1;
        ll idx2 = b2;

        while (idx1 < b2 && idx2 < b3) {
            ll y1s = get<2>(rooms[idx1]);
            ll y1e = get<3>(rooms[idx1]);
            ll y2s = get<2>(rooms[idx2]);
            ll y2e = get<3>(rooms[idx2]);
            ll ys = max(y1s, y2s);
            ll ye = min(y1e, y2e);

            if (ys < ye) {
                if (ybs.find(x) == ybs.end()) {
                    edgelist[idx1].pb(idx2);
                    edgelist[idx2].pb(idx1);
                }
                else {
                    auto iter1 = upper_bound(ALL(ybs.at(x)), ys);
                    auto iter2 = lower_bound(ALL(ybs.at(x)), ye);
                    if (iter1 != iter2 || !( (iter1 - ybs.at(x).begin()) & 1LL)) {
                        edgelist[idx1].pb(idx2);
                        edgelist[idx2].pb(idx1);
                    }
                }
            }

            if (y1e < y2e) idx1++;
            else idx2++;
        }
    }

    debug_printf("---- edgelist[10]\n");
    debug_print(edgelist[10]);
}

ll find_start_room(const V<t4> &rooms)
{
    rep (idx, rooms.size()) {
        ll x1 = get<0>(rooms[idx]);
        ll x2 = get<1>(rooms[idx]);
        ll y1 = get<2>(rooms[idx]);
        ll y2 = get<3>(rooms[idx]);
        if (x1 > 0 && x2 > 0) continue;
        if (x1 < 0 && x2 < 0) continue;
        if (y1 > 0 && y1 > 0) continue;
        if (y1 < 0 && y2 < 0) continue;
        return idx;
    }
}

ll f_area(t4 room)
{
    ll x1 = get<0>(room);
    ll x2 = get<1>(room);
    ll y1 = get<2>(room);
    ll y2 = get<3>(room);
    if (abs(x1) > 1e17 || abs(x2) > 1e17 || abs(y1) > 1e17 || abs(y2) > 1e17) {
        debug_printf("---- ans\n");
        cout << "INF" << endl;
        exit(0);
    }

    return (x2 - x1) * (y2 - y1);
}

void _main()
{
    ll n; llin(n);
    ll m; llin(m);
    S V<t3> xplist; llinl3(xplist, n); sort(xplist);
    S V<t3> yplist; llinl3(yplist, m); sort(yplist);

    S V<t4> rooms;
    make_rooms(rooms, xplist, yplist, n, m);

    S V<ll> idxs;
    make_idxs(idxs, rooms);

    S M<ll, V<ll> > ybs;
    make_yb(ybs, yplist);

    S V<ll> edgelist[4000010];
    make_edgelist(edgelist, rooms, idxs, ybs);

    ll sidx = find_start_room(rooms);
    debug_printf("---- sidx=%lld\n", sidx);

    S queue<ll> q;
    ll ans = 0;
    S set<ll> checked;

    q.push(sidx);
    ans += f_area(rooms[sidx]);
    checked.insert(sidx);

    while (q.size()) {
        ll idx = q.front(); q.pop();
        for (auto nidx : edgelist[idx]) {
            if (checked.find(nidx) != checked.end()) continue;
            q.push(nidx);
            ans += f_area(rooms[nidx]);
            checked.insert(nidx);
        }
    }

    debug_printf("----- ans\n");
    cout << ans << endl;
}

///////////////////////////////////////////////////////////////////////////////


Measured memory_bytes: 261544