#include <bits/stdc++.h>
//    #include <boost/multiprecision/cpp_int.hpp>
 #define int  long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
  #define PI 3.14159265358979323846
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-8)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x;
                                   				int y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
 
                      
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int Gcd(int v,int b){
                                	if(v==0) return b;
                                	if(b==0) return v;
                                	if(v>b) return Gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return Gcd(v,b%v);
                                }
                 
                            
                                int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {   
    return {l.first+r.first,l.second+r.second};                                    
}    
pa operator-(const pa & l,const pa & r) {   
    return {l.first-r.first,l.second-r.second};                                    
}  
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
 
                              
                int pr[1000100];
                int inv[1000110];
                

                
    			int comb(int nn,int rr){
    				if(rr<0 || rr>nn || nn<0) return 0;
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
               
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<=ert;i++){
                		pr[i]=((ll)pr[i-1]*i)%mod;
                	}
                		inv[ert]=beki(pr[ert],mod-2,mod);
                	for(int i=ert-1;i>=0;i--){
                		inv[i]=(ll)inv[i+1]*(i+1)%mod;
                	}
                }
               
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
 //   mt19937(clock_per_sec);
  //  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;

struct unionfind{
	private:
	public:
	
vector<int> par,ranks,kosuu;
	
	void shoki(int N){
		par.resize(N+1,0);
		ranks.resize(N+1,0);
		kosuu.resize(N+1,1);
		for(int i=0;i<=N;i++){
			par[i]=i;
		}
	}

	int root(int x){
		return par[x]==x ? x : par[x]=root(par[x]);
	}

	bool same(int x,int y){
		return root(x)==root(y);
	}
	bool is_root(int x){
		return x==root(x);
	}
	void unite(int x,int y){
 		x=root(x);
	 	y=root(y);
		int xx=kosuu[x],yy=kosuu[y];
	 	if(x==y) return;
		if(ranks[x]<ranks[y]){
			par[x]=y;
			kosuu[y]=yy+xx;
		}
	 	else {
			par[y]=x;
			if(ranks[x]==ranks[y]) ranks[x]=ranks[x]+1;
	 		kosuu[x]=yy+xx;
	 	}
		return;
	}
};

int X,Y;
int Tate[3030][3030];
int Yoko[3030][3030];
int ch(int i,int j){
	return Y*i+j;
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n,m;
	cin>>n>>m;
	vector<pa3> tate;
	vector<pa3> yoko;
	
	set<int> sex,sey;
	sex.insert(-inf);
	sex.insert(inf);
	sex.insert(0);
	sey.insert(-inf);
	sey.insert(inf);
	sey.insert(0);
	
	
	
	for(int i=0;i<n;i++){
		int y,yy,yyy;
		cin>>y>>yy>>yyy;
		sex.insert(y);
		sex.insert(yy);
		sey.insert(yyy);
			tate.pb((pa3){y,yy,yyy});
	}
	
	for(int i=0;i<m;i++){
		int y,yy,yyy;
		cin>>y>>yy>>yyy;
		sex.insert(y);
		sey.insert(yy);
		sey.insert(yyy);
			yoko.pb((pa3){y,yy,yyy});
		
	}
	map<int,int>mx,my;
	int cnt=0;
	vector<int>gx,gy;
	for(auto i:sex){
		mx[i]=cnt;
		gx.pb(i);
		cnt++;
	}
	X=gx.size();
	cnt=0;
	for(auto i:sey){
		my[i]=cnt;
		gy.pb(i);
		cnt++;
	}
	Y=gy.size();
	
	for(auto &v:tate){
		v.x=mx[v.x];
		v.y=mx[v.y];
		v.z=my[v.z];
	}
	
	for(auto &v:yoko){
		v.x=mx[v.x];
		v.y=my[v.y];
		v.z=my[v.z];
	}
	
	for(auto v:tate){
		Tate[v.x][v.z]++;
		Tate[v.y][v.z]--;
	}
	for(auto v:yoko){
		Yoko[v.x][v.y]++;
		Yoko[v.x][v.z]--;
	}
	
	for(int i=0;i<X;i++)for(int j=0;j<Y;j++){
		if(i)Tate[i][j]+=Tate[i-1][j];
		if(j)Yoko[i][j]+=Yoko[i][j-1];
	}
	
	unionfind uf;
	uf.shoki((X+10)*(Y+10));
	
	
	for(int i=0;i<X-1;i++)for(int j=0;j<Y-2;j++)if(Tate[i][j+1]==0){
		
		uf.unite(ch(i,j),ch(i,j+1));
	}
	for(int i=0;i<X-2;i++)for(int j=0;j<Y-1;j++)if(Yoko[i+1][j]==0){
	//	cout<<i<<" "<<j<<endl;
		uf.unite(ch(i,j),ch(i+1,j));
	}
//	cout<<mx[0]<<"   "<<my[0]<<endl;
	if(uf.same(0,ch(mx[0],my[0]))){
			cout<<"INF"<<endl;
		return 0;
	}
	int ans=0;
	int e=uf.root(ch(mx[0],my[0]));
	for(int i=0;i<X-1;i++)for(int j=0;j<Y-1;j++)if(uf.root(ch(i,j))==e){
		ans+=(gx[i+1]-gx[i])*(gy[j+1]-gy[j]);
	}
	cout<<ans<<endl;
	
	return 0;
 }




Measured memory_bytes: 358976