#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

int main() {
	ll N, M;
	cin >> N >> M;
	vll A(N + 1), B(N + 1), C(N + 1), D(M + 1), E(M + 1), F(M + 1);
	repn(i, N)cin >> A[i] >> B[i] >> C[i];
	repn(i, M)cin >> D[i] >> E[i] >> F[i];

	set<ll> stx, sty;
	repn(i, N) {
		stx.insert(A[i]);
		stx.insert(B[i]);
		sty.insert(C[i]);
	}
	stx.insert(0);
	repn(i, M) {
		stx.insert(D[i]);
		sty.insert(E[i]);
		sty.insert(F[i]);
	}
	sty.insert(0);

	vll vx, vy;
	while (!stx.empty()) {
		vx.push_back(*stx.begin());
		stx.erase(stx.begin());
	}
	while (!sty.empty()) {
		vy.push_back(*sty.begin());
		sty.erase(sty.begin());
	}

	ll H = vx.size();
	ll W = vy.size();

	vvll g(2 * H + 1, vll(2 * W + 1, 0));
	vvll area(2 * H + 1, vll(2 * W + 1, 0));

	repn(i, N) {
		ll a = distance(vx.begin(), lower_bound(vx.begin(), vx.end(), A[i]));
		ll b = distance(vx.begin(), lower_bound(vx.begin(), vx.end(), B[i]));
		ll c = distance(vy.begin(), lower_bound(vy.begin(), vy.end(), C[i]));

		for (ll x = 2 * a + 1; x <= 2 * b + 1; x++) {
			g[x][2 * c + 1] = -1;
		}
	}

	repn(i, M) {
		ll d = distance(vx.begin(), lower_bound(vx.begin(), vx.end(), D[i]));
		ll e = distance(vy.begin(), lower_bound(vy.begin(), vy.end(), E[i]));
		ll f = distance(vy.begin(), lower_bound(vy.begin(), vy.end(), F[i]));

		for (ll x = 2 * e + 1; x <= 2 * f + 1; x++) {
			g[2 * d + 1][x] = -1;
		}
	}

	//rep(i, 2 * H + 1) {
	//	rep(j, 2 * W + 1) {
	//		cout << g[i][j] + 1 << " ";
	//	}
	//	cout << endl;
	//}

	rep(i,H-1)rep(j,W-1){
		ll ar = (vx[i + 1] - vx[i]) * (vy[j + 1] - vy[j]);
		area[2 * i + 2][2 * j + 2] = ar;
	}

	queue<ll> qx;
	queue<ll> qy;
	ll sx = distance(vx.begin(), lower_bound(vx.begin(), vx.end(), 0));
	ll sy = distance(vy.begin(), lower_bound(vy.begin(), vy.end(), 0));
	qx.push(sx * 2 + 1);
	qy.push(sy * 2 + 1);
	g[sx * 2 + 1][sy * 2 + 1] = -1;

	vll dx = { 1,0,-1,0 };
	vll dy = { 0,1,0,-1 };

	ll ans = 0;
	while (!qx.empty()) {
		ll x = qx.front();
		qx.pop();
		ll y = qy.front();
		qy.pop();

		rep(j, 4) {
			ll xx = x + dx[j];
			ll yy = y + dy[j];
			if (g[xx][yy] == -1) { continue; }
			//cout << xx << " " << yy << endl;
			if (xx == 0 || xx == 2 * H || yy == 0 || yy == 2 * W) { cout << "INF" << endl; return 0; }

			qx.push(xx);
			qy.push(yy);
			g[xx][yy] = -1;
			ans += area[xx][yy];
		}
	}

	cout << ans << endl;

}


Measured memory_bytes: 567136