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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)
#define ABS(x) max((x),-(x))

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
inline ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

inline ll ADD(ll x, ll y) { return (x+y) % MOD; }
inline ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
inline ll MUL(ll x, ll y) { return x*y % MOD; }
inline ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
inline ll INV(ll y) { /*assert(y%MOD!=0);*/ return POW(y, MOD-2); }
inline ll DIV(ll x, ll y) { return MUL(x, INV(y)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

void horizontal(vector<int>& v) {
    int L = v.size();
    for (int i=0; i<L; ++i) {
        printf("%d%c", v[i], (i==L-1)?'\n':' ');
    }
}
void horizontall(vector<long long>& v) {
    int L = v.size();
    for (int i=0; i<L; ++i) {
        printf("%lld%c", v[i], (i==L-1)?'\n':' ');
    }
}

class UnionFind2D {
 public:
    vector<int> data;
    int height, width;
    int count;
    inline int RC(int r, int c) { return r * width + c; }
    inline bool inside(int r, int c) { return (0 <= r && r < height && 0 <= c && c < width); }
 public:
    UnionFind2D(int height, int width)
      : data(height*width, -1), height(height), width(width), count(height*width) { }

    bool unionSet(int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y]; data[y] = x;
            --count;
        }
        return x != y;
    }
    bool isSame(int x, int y) { return root(x) == root(y); }
    int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    int size(int x) { return -data[root(x)]; }

    bool unionSet(int r0, int c0, int r1, int c1) {
        if (!inside(r0, c0) || !inside(r1, c1)) return false;
        return unionSet(RC(r0,c0), RC(r1,c1));
    }
    bool isSame(int r0, int c0, int r1, int c1) {
        if (!inside(r0, c0) || !inside(r1, c1)) return false;
        return root(r0,c0) == root(r1,c1);
    }
    int root(int r, int c) {
        if (!inside(r,c)) return -1;
        return root(RC(r,c));
    }
    int size(int r, int c) {
        if (!inside(r,c)) return 0;
        return size(RC(r,c));
    }

    bool unionSet(pair<int,int>& p0, pair<int,int>& p1) {
        return unionSet(p0.first, p0.second, p1.first, p1.second);
    }
    bool isSame(pair<int,int>& p0, pair<int,int>& p1) {
        return isSame(p0.first, p0.second, p1.first, p1.second);
    }
    int root(pair<int,int>& p) { return root(p.first, p.second); }
    int size(pair<int,int>& p) { return size(p.first, p.second); }
};


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

ll solve(int N,int M, vi& a,vi& b,vi& c, vi&d, vi& e, vi&f) {
#define BIG 1000000001

    set<int> xu,yu;
    xu.insert(BIG);
    xu.insert(-BIG);
    xu.insert(0);
    rep(i,N){
        xu.insert(a[i]);
        xu.insert(b[i]);
        yu.insert(c[i]);
    }
    yu.insert(BIG);
    yu.insert(-BIG);
    yu.insert(0);
    rep(i,M){
        xu.insert(d[i]);
        xu.insert(e[i]);
        yu.insert(f[i]);
    }
    map<int,int> Ax,Ay; int xid=0,yid=0;
    vi Rx,Ry;
    for(int x:xu){
        Rx.pb(x);
        Ax[x] = xid++;
    }
    for(int y:yu){
        Ry.pb(y);
        Ay[y] = yid++;
    }

    int sx=Ax[0], sy=Ay[0];

    int xw=xid*2, yw=yid*2;
    vvi mp(xw, vi(yw,0));
    rep(i,N){
        int x0=Ax[a[i]], x1=Ax[b[i]], y=Ay[c[i]];
        for(int x=x0*2;x<=x1*2;++x) mp[x][y*2] = 1;
    }
    rep(i,M){
        int x=Ax[d[i]], y0=Ay[e[i]], y1=Ay[f[i]];
        for(int y=y0*2;y<=y1*2;++y) mp[x*2][y] = 1;
    }
    if (mp[sx*2][sy*2] == 1) return 0;

    UnionFind2D uf(xw, yw);

    for(int x=1;x<xw-1;++x){
        for(int y=1;y<yw-1;++y){
            if (mp[x][y]==1) continue;
            rep(d,4){
                int xd=x+dx[d], yd=y+dy[d];
                if (mp[xd][yd]==1) continue;
                uf.unionSet(x,y, xd,yd);
            }
        }
    }
    int sr = uf.root(sx*2,sy*2);

    rep(y,yw){
        if (uf.root(0,y) == sr) return -1;
        if (uf.root(xw-1,y) == sr) return -1;
    }
    rep(x,xw){
        if (uf.root(x,0) == sr) return -1;
        if (uf.root(x,yw-1) == sr) return -1;
    }
    ll ans =0;
    rep(x,xid)rep(y,yid){
        if (uf.root(x*2+1, y*2+1) == sr) {
            ll h =(Rx[x+1] - Rx[x]), w =(Ry[y+1] - Ry[y]);
            ans += h * w;
        }
    }
    return ans;
}

int main() {
    int N, M; cin>>N>>M;
    vi a(N),b(N),c(N);
    rep(i,N) cin>>a[i]>>b[i]>>c[i];
    vi d(M),e(M),f(M);
    rep(i,M) cin>>d[i]>>e[i]>>f[i];
    ll ans = solve(N,M,a,b,c,d,e,f);
    if (ans < 0)
        cout << "INF" << endl;
    else
        cout << ans << endl;
    return 0;
}
