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

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...)                                                         \
    ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...)                                                        \
    ([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second

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 (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << rt;                                                            \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                        \
        rep(_i, h) {                                                           \
            rep(_j, w) cerr << a[_i][_j] << sp;                                \
            cerr << rt;                                                        \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(_i, n) if (_i) cerr << sp << a[_i];                                \
        else cerr << a[_i];                                                    \
        cerr << "]" << rt;                                                     \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
    return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

queue<pair<ll, ll>> Q;
ll S[6010][6010];
signed main() {
    ll N, M;
    cin >> N >> M;
    ll A[N], B[N], C[N], D[M], E[M], F[M];
    vector<ll> X, Y;
    inc(i, -1, 0) X.pb(i), Y.pb(i);
    X.push_back(-INF), X.push_back(INF - 1), X.push_back(INF);
    Y.push_back(-INF), Y.push_back(INF - 1), Y.push_back(INF);
    rep(i, N) {
        cin >> A[i] >> B[i] >> C[i];
        X.push_back(2 * A[i]), X.push_back(2 * B[i]);
        X.push_back(2 * A[i] - 1), X.push_back(2 * B[i] - 1);
        Y.push_back(2 * C[i]);
        Y.push_back(2 * C[i] - 1);
    }
    rep(i, M) {
        cin >> D[i] >> E[i] >> F[i];
        X.push_back(2 * D[i]);
        X.push_back(2 * D[i] - 1);
        Y.push_back(2 * E[i]);
        Y.push_back(2 * E[i] - 1);
        Y.push_back(2 * F[i]);
        Y.push_back(2 * F[i] - 1);
    }
    all(sort, X), all(sort, Y);
    X.erase(all(unique, X), X.end());
    Y.erase(all(unique, Y), Y.end());
    // vdump(X, X.size());
    // vdump(Y, Y.size());
    ll H = X.size(), W = Y.size();
    map<ll, ll> x, y;
    rep(i, H) x[X[i]] = i;
    rep(i, W) y[Y[i]] = i;
    rep(i, H) rep(j, W) S[i][j] = 0;
    rep(i, N) {
        S[x[2 * A[i]]][y[2 * C[i]]]++;
        S[x[2 * A[i]]][y[2 * C[i]] + 1]--;
        S[x[2 * B[i]] + 1][y[2 * C[i]]]--;
        S[x[2 * B[i]] + 1][y[2 * C[i]] + 1]++;
    }
    rep(i, M) {
        S[x[2 * D[i]]][y[2 * E[i]]]++;
        S[x[2 * D[i]] + 1][y[2 * E[i]]]--;
        S[x[2 * D[i]]][y[2 * F[i]] + 1]--;
        S[x[2 * D[i]] + 1][y[2 * F[i]] + 1]++;
    }
    rep(i, H - 1) rep(j, W) S[i + 1][j] += S[i][j];
    rep(i, H) rep(j, W - 1) S[i][j + 1] += S[i][j];
    Q.push({x[0], y[0]});
    S[x[0]][y[0]] = -1;
    while (!Q.empty()) {
        pair<ll, ll> now = Q.front();
        Q.pop();
        rep(i, 4) {
            pair<ll, ll> next = make_pair(now.fi + dx[i], now.se + dy[i]);
            if (0 <= next.fi && next.fi < H && 0 <= next.se && next.se < W)
                if (S[next.fi][next.se] == 0) {
                    Q.push(next);
                    S[next.fi][next.se] = -1;
                }
        }
    }
    if (S[H - 1][W - 1] == -1) {
        cout << "INF" << rt;
        return 0;
    }
    // debug(x[0], y[0]);
    ll res = 0;
    rep(i, H) rep(j, W) {
        if (S[i][j] == -1) {
            S[i][j] = 8;
            if (X[i] & 1 and Y[j] & 1) {
                S[i][j] = 4;
                res += (X[i + 1] - X[i - 1]) * (Y[j + 1] - Y[j - 1]) / 4;
            }
        }
    }
    // dump(S, H, W);
    cout << res << rt;
}

// -g -D_GLIBCXX_DEBUG -fsanitize=undefined


Measured memory_bytes: 286508