#define _CRT_SECURE_NO_WARNINGS

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k && k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k < '0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k && k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k < '0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V& w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x < 0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x < 0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ' '); writer(y, ' '); writer(z, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }
void reader(ull& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k && k <= '9') { x = ull(k - '0'); break; } }for (;;) { mygc(k); if (k < '0' || k>'9')break; x = x * 10 + k - '0'; } }
void writer(ull x, char c) { int s = 0, m = 0; char f[20]; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; }

#ifdef _MSC_VER
// #ifdef _DEBUG
template <typename ... Args>
void debugPrintf(const char* format, Args const& ... args) {
	fprintf(stderr, format, args ...);
	fflush(stderr);
}
#else
#define debugPrintf(...)
#endif

const int MOD = 1000000007;

bool used[3010][3010];
bool blocked[3010][3010][4];

int main() {
	int n, m; reader(n, m);
	vector<int> x, y;
	x.push_back(0);
	y.push_back(0);

	vector<tuple<int,int,int>> abc,def;
	FOR(i, n) {
		int a, b, c; reader(a, b, c);
		x.push_back(a);
		x.push_back(b);
		y.push_back(c);
		abc.emplace_back(a, b, c);
	}
	FOR(i, m) {
		int d, e, f; reader(d, e, f);
		x.push_back(d);
		y.push_back(e);
		y.push_back(f);
		def.emplace_back(d, e, f);
	}
	auto xConv = [&x](int v) {
		return lower_bound(x.begin(), x.end(), v) - x.begin();
	};
	auto yConv = [&y](int v) {
		return lower_bound(y.begin(), y.end(), v) - y.begin();
	};
	{
		sort(x.begin(), x.end());
		x.erase(unique(x.begin(), x.end()), x.end());
		sort(y.begin(), y.end());
		y.erase(unique(y.begin(), y.end()), y.end());
		FOR(i, n) {
			int a, b, c; tie(a, b, c) = abc[i];
			tie(a,b,c) = make_tuple(xConv(a), xConv(b), yConv(c));
			for (int p = a + 1; p <= b; p++) {
				blocked[p][c][3] = true;
				blocked[p][c + 1][1] = true;
			}
		}
		FOR(i, m) {
			int a, b, c; tie(a, b, c) = def[i];
			tie(a, b, c) = make_tuple(xConv(a), yConv(b), yConv(c));
			for (int p = b + 1; p <= c; p++) {
				blocked[a][p][0] = true;
				blocked[a+1][p][2] = true;
			}
		}
	}

	int sx = xConv(0);
	int sy = yConv(0);
	queue<Pii> q;
	FOR(i, 2) FOR(j, 2) q.emplace(sx + i, sy + j), used[sx + i][sy+j] = true;
	while (!q.empty()) {
		int a, b; tie(a, b) = q.front(); q.pop();
		int dx[] = { 1,0,-1,0 }, dy[] = { 0,-1,0,1 };
		FOR(k, 4) {
			int na = a + dx[k], nb = b + dy[k];
			if (na < 0 || na > sz(x) || nb < 0 || nb > sz(y)) continue;
			if (blocked[a][b][k]) continue;
			if (used[na][nb]) continue;
			used[na][nb] = true;
			q.emplace(na, nb);
		}
	}

	ll ans = 0;
	bool inf = false;
	FOR(i, sz(x) + 1) {
		if (inf) break;
		FOR(j, sz(y) + 1) {
			if (!used[i][j]) continue;
			if (i == 0 || i == sz(x) || j == 0 || j == sz(y)) {
				inf = true;
				break;
			}
			ll dx = x[i] - x[i - 1];
			ll dy = y[j] - y[j - 1];
			ans += dx * dy;
		}
	}
	if (inf) {
		puts("INF");
	} else {
		writerLn(ans);
	}

	return 0;
}


Measured memory_bytes: 44548