// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-11;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	inline long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ
int zx[5100];
int zy[5100];
int A[5100];
int B[5100];
int C[5100];
int D[5100];
int bfs[4100][4100];
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int T[4100][4100];
int Y[4100][4100];
int main(){
	int a,b;scanf("%d%d",&a,&b);
	int sz=0;
	for(int i=0;i<a;i++){
		int p,q,r;
		scanf("%d%d%d",&p,&q,&r);
		A[sz]=p;
		B[sz]=D[sz]=r;
		C[sz]=q;
		sz++;
	}
	for(int i=0;i<b;i++){
		int p,q,r;
		scanf("%d%d%d",&p,&q,&r);
		B[sz]=q;
		A[sz]=C[sz]=p;
		D[sz]=r;
		sz++;
	}
	for(int i=0;i<sz;i++){
		zx[i*2]=A[i];
		zx[i*2+1]=C[i];
		zy[i*2]=B[i];
		zy[i*2+1]=D[i];
	}
	std::sort(zx,zx+sz*2);
	std::sort(zy,zy+sz*2);
	queue<pair<int,int> > Q;
	int sx=lower_bound(zx,zx+sz*2,0)-zx;
	int sy=lower_bound(zy,zy+sz*2,0)-zy;
	for(int i=0;i<sz;i++){
		if(B[i]==D[i]){
			int at=lower_bound(zy,zy+sz*2,B[i])-zy;
			int L=lower_bound(zx,zx+sz*2,A[i])-zx;
			int R=lower_bound(zx,zx+sz*2,C[i])-zx;
			T[L][at]++;
			T[R][at]--;
		}else{
			int at=lower_bound(zx,zx+sz*2,A[i])-zx;
			int L=lower_bound(zy,zy+sz*2,B[i])-zy;
			int R=lower_bound(zy,zy+sz*2,D[i])-zy;
			Y[at][L]++;
			Y[at][R]--;
		}
	}
	for(int i=0;i<sz*2;i++){
		for(int j=0;j<sz*2;j++){
			T[i+1][j]+=T[i][j];
			Y[i][j+1]+=Y[i][j];
		}
	}
	Q.push(make_pair(sx,sy));
	bfs[sx][sy]=1;
	while(Q.size()){
		int row=Q.front().first;
		int col=Q.front().second;Q.pop();
		for(int i=0;i<4;i++){
			int tr=row+dx[i];
			int tc=col+dy[i];
			if(tr<0||tc<0||tr>sz*2||tc>sz*2)continue;
			if(bfs[tr][tc])continue;
			if(tr==row){
				if(tr&&T[tr-1][min(tc,col)])continue;
			}else{
				if(tc&&Y[min(tr,row)][tc-1])continue;
			}
			bfs[tr][tc]=1;
			Q.push(make_pair(tr,tc));
		}
	}
	long long ret=0;
	for(int i=0;i<=sz*2;i++){
		for(int j=0;j<=sz*2;j++){
			if(bfs[i][j]==0)continue;
			if(i==0||j==0||i==sz*2||j==sz*2){
				printf("INF\n");return 0;
			}
			ret+=(long long)(zx[i]-zx[i-1])*(zy[j]-zy[j-1]);
		}
	}
	printf("%lld\n",ret);
}

Measured memory_bytes: 195436