#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

void chmin(int &a, int b) {
	a = min(a, b);
}
void chmax(int &a, int b) {
	a = max(a, b);
}
ll mod_pow(ll a, ll n, ll m = mod) {
	a %= m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

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

bool exi[3002][3002][4];

bool visited[3002][3002];
void solve() {
	int n, m; cin >> n >> m;
	vector<int> vx, vy;
	vector<P> p1; vector<int> t1;
	rep(i, n) {
		int a, b, c; cin >> a >> b >> c;
		p1.push_back({ a,b });
		t1.push_back(c);
		vx.push_back(a);
		vx.push_back(b);
		vy.push_back(c);
	}
	vector<P> p2; vector<int> t2;
	rep(i, m) {
		int a, b, c; cin >> a >> b >> c;
		p2.push_back({ b,c });
		t2.push_back(a);
		vx.push_back(a);
		vy.push_back(b);
		vy.push_back(c);
	}

	vx.push_back(-mod);
	vx.push_back(mod);
	sort(all(vx));
	sort(all(vy));
	vx.erase(unique(all(vx)), vx.end());
	vy.erase(unique(all(vy)), vy.end());

	rep(i, vx.size())rep(j, vy.size())rep(k, 4)exi[i][j][k] = true;
	rep(i, n) {
		int y = lower_bound(all(vy), t1[i]) - vy.begin();
		int lx = lower_bound(all(vx), p1[i].first) - vx.begin();
		int rx = lower_bound(all(vx), p1[i].second) - vx.begin();
		for (int x = lx; x < rx; x++) {
			exi[x][y - 1][0] = false;
			exi[x][y][2] = false;
		}
	}
	rep(i, m) {
		int x = lower_bound(all(vx), t2[i]) - vx.begin();
		int ly = lower_bound(all(vy), p2[i].first) - vy.begin();
		int ry = lower_bound(all(vy), p2[i].second) - vy.begin();
		for (int y = ly; y < ry; y++) {
			exi[x - 1][y][1] = false;
			exi[x][y][3] = false;
		}
	}
	queue<P> q;
	rep(i, vx.size() - 1)rep(j, vy.size() - 1) {
		if (vx[i] <= 0 && 0 <= vx[i + 1] && vy[j] <= 0 && 0 <= vy[j + 1]) {
			visited[i][j] = true;
			q.push({ i,j });
		}
	}
	while (!q.empty()) {
		P p = q.front(); q.pop();
		int x = p.first, y = p.second;
		rep(d, 4) {
			if (!exi[x][y][d])continue;
			int nx = x + dx[d];
			int ny = y + dy[d];
			if (nx < 0 || nx >= vx.size() || ny < 0 || ny >= vy.size())continue;
			if (visited[nx][ny])continue;
			visited[nx][ny] = true;
			q.push({ nx,ny });
		}
	}
	if (visited[0][0]) {
		cout << "INF\n";
	}
	else {
		ll ans = 0;
		rep(i, vx.size() - 1)rep(j, vy.size() - 1) {
			if (!visited[i][j])continue;
			ll x = vx[i + 1] - vx[i];
			ll y = vy[j + 1] - vy[j];
			ans += x * y;
		}
		cout << ans << "\n";
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	solve();
	stop
		return 0;
}


Measured memory_bytes: 51784