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

#define LL long long
//#define LL __int64
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;

template< typename T > inline void read(T &x)
{
    static char _c;
    static bool _f;

    x = 0;
    _f = 0;
    _c = getchar();

    while(_c < '0' || '9' < _c) {if(_c == '-') _f = true; _c = getchar();}
    while('0' <= _c && _c <= '9') {x = (x << 1) + (x << 3) + (_c & 15); _c = getchar();}
    if(_f) x = -x;
}
template < typename T, typename ...Args > inline void read(T &x, Args &...args) {read(x); read(args...);}

template < typename T > inline void Min(T &x, T y) {if(y < x) x = y;}
template < typename T > inline void Max(T &x, T y) {if(x < y) x = y;}


#define lowbit(x) ((x) & -(x))
#define lson l,mid,id<<1
#define rson mid+1,r,id<<1|1
#define ls id<<1
#define rs id<<1|1
#define MID(l,r) ((l)+(((r)-(l))>>1))
#define fi first
#define se second
#define mk make_pair
#define mt make_tuple
#define pb push_back
#define all(a) a.begin(),a.end()

const int INF = 0x3f3f3f3f;
const LL LINF = 0x3f3f3f3f3f3f3f3f;
const double pi = (double) acos(-1.0);
const double eps = (double) 1e-8;
const int e5 = (int) 1e5 + 5;
//const int MOD = (int) 1e9 + 7;
const int MOD = (int) 1000000007;
//const int MOD = 998244353;

template< typename T0, typename T1 > inline void depair(T0 &x, T1 &y, pair<T0, T1> &p) {x = p.fi, y = p.se;}
inline int sig(double x) {return x < -eps ? -1 : eps < x;}
LL fp(LL a, LL n, LL mod = MOD)
{
    if(n < 0) a = fp(a, mod - 2, mod), n = -n;
    LL res = 1; for(; n; n >>= 1, a = a * a % mod) if(n & 1) res = res * a % mod; return res;
}

struct Mint
{
    int x;
    Mint() {x = 0;}
    Mint(int _x): x(_x) {if(x < 0 || x >= MOD) x = (x % MOD + MOD) % MOD;}
    Mint(LL _x): x(_x) {if(x < 0 || x >= MOD) x = (x % MOD + MOD) % MOD;}
    Mint operator - () const{
        return Mint(MOD - x);
    }
    Mint operator + (const Mint &rhs) const{
        return Mint(x + rhs.x >= MOD ? x + rhs.x - MOD : x + rhs.x);
    }
    Mint operator - (const Mint &rhs) const{
        return Mint(x - rhs.x < 0 ? x - rhs.x + MOD : x - rhs.x);
    }
    Mint operator * (const Mint &rhs) const{
        return Mint((LL)x * rhs.x % MOD);
    }
    Mint operator / (const Mint &rhs) const{
        return Mint(x * fp(rhs.x, -1) % MOD);
    }
    Mint& operator += (const Mint &rhs) {
        x += rhs.x; if(x >= MOD) x -= MOD; return *this;
    }
    Mint& operator *= (const Mint &rhs) {
        x = ((LL)x * rhs.x) % MOD; return *this;
    }
    bool operator == (const Mint &rhs) const{
        return x == rhs.x;
    }
    bool operator != (const Mint &rhs) const{
        return x != rhs.x;
    }
    friend ostream& operator << (ostream &out, const Mint &rhs){
        return out << rhs.x;
    }
    friend istream& operator >> (istream &in, Mint &rhs){
        return in >> rhs.x;
    }
};


const int maxn = (int) 2e5 + 20;
const int maxm = (int) 1e6 + 20;

void work()
{
    int n, m;
    cin >>n >>m;
    vector<tuple<int, int, int> > a(n), b(m);

    vector<int> dx, dy;
    for(int i = 0; i < n; i++)
    {
        int x, y, z;
        cin >>x >>y >>z;
        dx.pb(x);
        dx.pb(y);
        dy.pb(z);

        a[i] = mt(x, y, z);
    }
    for(int i = 0; i < m; i++)
    {
        int x, y, z;
        cin >>x >>y >>z;
        dx.pb(x);
        dy.pb(y);
        dy.pb(z);

        b[i] = mt(x, y, z);
    }

    dx.pb(-INF);
    dx.pb(INF);
    dy.pb(-INF);
    dy.pb(INF);

    sort(all(dx));
    sort(all(dy));

    dx.erase(unique(all(dx)), dx.end());
    dy.erase(unique(all(dy)), dy.end());

//    cout <<"dx : "; for(auto x : dx) cout <<x <<" "; cout <<endl;

    int p = dx.size();
    int q = dy.size();

    vector< vector<int> > up, down, left, right;

    up = down = left = right = vector< vector<int> > (p, vector<int> (q, 0));

    for(int i = 0; i < n; i++)
    {
        int x, y, z;
        tie(x, y, z) = a[i];

        x = lower_bound(all(dx), x) - dx.begin();
        y = lower_bound(all(dx), y) - dx.begin();
        z = lower_bound(all(dy), z) - dy.begin();

//        cout <<"1: " <<x <<" " <<y <<" " <<z <<endl;

        up[x][z - 1]++; up[y][z - 1]--;
        down[x][z]++; down[y][z]--;
    }

    for(int i = 0; i < m; i++)
    {
        int x, y, z;
        tie(x, y, z) = b[i];

        x = lower_bound(all(dx), x) - dx.begin();
        y = lower_bound(all(dy), y) - dy.begin();
        z = lower_bound(all(dy), z) - dy.begin();

//        cout <<"2: " <<x <<" " <<y <<" " <<z <<endl;

        right[x - 1][y]++; right[x - 1][z]--;
        left[x][y]++; left[x][z]--;
    }

    for(int i = 0; i < p; i++)
    {
        for(int j = 0; j < q; j++)
        {
            if(i) up[i][j] += up[i - 1][j];
            if(i) down[i][j] += down[i - 1][j];

            if(j) left[i][j] += left[i][j - 1];
            if(j) right[i][j] += right[i][j - 1];
        }
    }


//    for(int i = 0; i < p; i++)
//    {
//        for(int j = 0; j < q; j++)
//            cout <<up[i][j];
//        cout <<endl;
//    }

    int sx = lower_bound(all(dx), 0) - dx.begin() - 1;
    int sy = lower_bound(all(dy), 0) - dy.begin() - 1;

//    cout <<sx <<" " <<sy <<endl;

    vector< vector<bool> > vis(p, vector<bool> (q, 0));

    vis[sx][sy] = 1;

    queue<pii> Q;
    Q.push(mk(sx, sy));
    while(Q.size())
    {
        int x = Q.front().fi;
        int y = Q.front().se;
        Q.pop();

        if(x == 0 || x == p - 1 || y == 0 || y == q - 1)
        {
            cout <<"INF" <<endl;
            return ;
        }

        if(!up[x][y] && !vis[x][y + 1])
        {
            vis[x][y + 1] = 1;
            Q.push(mk(x, y + 1));
        }
        if(!down[x][y] && !vis[x][y - 1])
        {
            vis[x][y - 1] = 1;
            Q.push(mk(x, y - 1));
        }
        if(!left[x][y] && !vis[x - 1][y])
        {
            vis[x - 1][y] = 1;
            Q.push(mk(x - 1, y));
        }
        if(!right[x][y] && !vis[x + 1][y])
        {
            vis[x + 1][y] = 1;
            Q.push(mk(x + 1, y));
        }
    }

//    for(int i = 0; i < p; i++)
//    {
//        for(int j = 0; j < q; j++)
//            cout <<vis[i][j];
//        cout <<endl;
//    }

    LL area = 0;
    for(int i = 1; i < p - 1; i++)
        for(int j = 1; j < q - 1; j++)
            if(vis[i][j])
                area += (LL)(dx[i + 1] - dx[i]) * (dy[j + 1] - dy[j]);

    cout <<area <<endl;
}

int main(int argc, char **argv)
{
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif // yukihana0416
//    get_prime();
//    pre();
    int tc = 1;
//    read(tc);
    for(int ca = 1; ca <= tc; ca++)
    {
//        printf("Case #%d: ", ca);
        work();
    }
    return 0;
}


Measured memory_bytes: 146136