#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
#define MOD 1000000007LL
//#define MOD 998244353LL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
// const vector<lint> dx={-1,-1,0,1,0,1,1,-1};
// const vector<lint> dy={-1,0,-1,0,1,1,-1,1};
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};

int main(){
    lint n,m;
    cin>>n>>m;
    vec x,y;
    vec a(n),b(n),c(n),d(m),e(m),f(m);
    rep(i,n){
        cin>>a[i]>>b[i]>>c[i];
    }
    rep(i,m){
        cin>>d[i]>>e[i]>>f[i];
    }
    x.push_back(0);
    y.push_back(0);
    x.insert(x.end(),all(a));
    x.insert(x.end(),all(b));
    y.insert(y.end(),all(c));
    x.insert(x.end(),all(d));
    y.insert(y.end(),all(e));
    y.insert(y.end(),all(f));
    sort(all(x));
    sort(all(y));
    x.erase(unique(all(x)),x.end());
    y.erase(unique(all(y)),y.end());
    rep(i,n)a[i]=lower_bound(all(x),a[i])-x.begin();
    rep(i,n)b[i]=lower_bound(all(x),b[i])-x.begin();
    rep(i,n)c[i]=lower_bound(all(y),c[i])-y.begin();
    rep(i,m)d[i]=lower_bound(all(x),d[i])-x.begin();
    rep(i,m)e[i]=lower_bound(all(y),e[i])-y.begin();
    rep(i,m)f[i]=lower_bound(all(y),f[i])-y.begin();
    lint h=x.size(),w=y.size();
    mat v(h,vec(w,0));
    rep(i,n){
        repi(j,a[i],b[i]){
            v[j][c[i]]|=1;
        }
    }
    rep(i,m){
        repi(j,e[i],f[i]){
            v[d[i]][j]|=2;
        }
    }
    mat aa(h,vec(w,0));
    lint ans=0;
    function<void(lint,lint)>fn=[&](lint nx,lint ny){
        if(aa[nx][ny]==0)ans+=abs(x[nx+1]-x[nx])*abs(y[ny+1]-y[ny]);
        aa[nx][ny]=1;
        rep(i,4){
            lint tx=nx+dx[i],ty=ny+dy[i];
            if(dy[i]==-1&&!(v[nx][ny]&1)&&ny==0){
                cout<<"INF"<<endl;
                exit(0);
            }
            if(dx[i]==-1&&!(v[nx][ny]&2)&&nx==0){
                cout<<"INF"<<endl;
                exit(0);
            }
            if(dy[i]==1&&!(v[nx][ny]&1)&&ny==w-2){
                cout<<"INF"<<endl;
                exit(0);
            }
            if(dx[i]==1&&!(v[nx][ny]&1)&&nx==h-2){
                cout<<"INF"<<endl;
                exit(0);
            }
            if(tx<0||h<=tx||ty<0||w<=ty)continue;
            if(dy[i]==-1&&(v[nx][ny]&1))continue;
            if(dx[i]==-1&&(v[nx][ny]&2))continue;
            if(dy[i]==1&&(v[tx][ty]&1))continue;
            if(dx[i]==1&&(v[tx][ty]&2))continue;
            if(aa[tx][ty])continue;
            fn(tx,ty);
        }
    };
    lint sx=lower_bound(all(x),0)-x.begin();
    lint sy=lower_bound(all(y),0)-y.begin();
    if(sx<0||h-1<=sx||sy<0||w-1<=sy){
        cout<<"INF"<<endl;
        exit(0);
    }
    fn(sx,sy);
    aa[sx][sy]=1;
    cout<<ans<<endl;
}