#include <bits/stdc++.h>
using namespace std;

#if __has_include(<boost/multiprecision/cpp_int.hpp>)
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<100>>;
	using namespace boost::multiprecision;
#endif

#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE 1
	#include <boost/stacktrace.hpp>
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
#ifdef LOCAL_DEV
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
//#define int long long
using ll = long long;
//constexpr int INF = (ll)1e9 + 7;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/

class UnionFind {
public:
	vector<ll> v;
	UnionFind(size_t size) : v(size, -1) {}

	ll root(ll x) {
		return (v[x] < 0 ? x : v[x] = root(v[x]));
	}

	bool is_root(ll x) {
		return x == root(x);
	}

	bool is_same(ll x, ll y) {
		return root(x) == root(y);
	}

	bool unite(ll x, ll y) {
		x = root(x);
		y = root(y);
		if (x == y) return false;
		if (v[x] > v[y]) swap(x, y);
		v[x] += v[y];
		v[y] = x;
		return true;
	}

	ll size(ll x) {
		return -v[root(x)];
	}
};


template< typename T >
class Compress {
public:
	vector< T > xs;

	Compress() = default;

	Compress(const vector< T > &vs) {
		add(vs);
	}

	Compress(const initializer_list< vector< T > > &vs) {
		for(auto &p : vs) add(p);
	}

	void add(const vector< T > &vs) {
		copy(begin(vs), end(vs), back_inserter(xs));
	}

	void add(const T &x) {
		xs.emplace_back(x);
	}

	void build() {
		sort(begin(xs), end(xs));
		xs.erase(unique(begin(xs), end(xs)), end(xs));
	}

	vector< ll > get(const vector< T > &vs) const {
		vector< ll > ret;
		transform(begin(vs), end(vs), back_inserter(ret), [&](const T &x) {
			return lower_bound(begin(xs), end(xs), x) - begin(xs);
		});
		return ret;
	}

	//value->index
	ll get(const T &x) const {
		return lower_bound(begin(xs), end(xs), x) - begin(xs);
	}

	//index->value
	const T &operator[](ll k) const {
		return xs[k];
	}

	size_t size() const {
		return xs.size();
	}
};

/*-----8<-----library-----8<-----*/

void solve() {
	ll N,M;
	cin>>N>>M;
	vector<ll> A(N),B(N),C(N); //(A,C)-(B,C)
	vector<ll> D(M),E(M),F(M); //(D,E)-(D,F)
	rep(i,N)cin>>A[i]>>B[i]>>C[i];
	rep(i,M)cin>>D[i]>>E[i]>>F[i];

	vector<ll> X,Y;
	X.push_back(-INF);
	X.push_back(INF);
	Y.push_back(-INF);
	Y.push_back(INF);
	rep(i,N){
		X.push_back(A[i]);
		X.push_back(B[i]);
		Y.push_back(C[i]);
	}
	rep(i,M){
		X.push_back(D[i]);
		Y.push_back(E[i]);
		Y.push_back(F[i]);
	}

	Compress<ll> compX(X), compY(Y);
	compX.build();
	compY.build();

	// リアル座標値が圧縮座標のどのインデックスに含まれるかを求める
	auto findx = [&](ll x)->ll{ return compX.get(x) - 1; };
	auto findy = [&](ll y)->ll{ return compY.get(y) - 1; };

	// 圧縮後の座標の、up: 真上に線がある/ left: 真左に線がある
	ll size=(compX.size()-1) * (compY.size()-1);
	vector<vector<bool>> up(compX.size()-1, vector<bool>(compY.size()-1, false));
	vector<vector<bool>> left(compX.size()-1, vector<bool>(compY.size()-1, false));

	debug(compX.xs);
	debug(compY.xs);
	rep(i,N){
		ll a = compX.get(A[i]);
		ll b = compX.get(B[i]);
		ll c = compY.get(C[i]);
		debug(a,b,c);
		for(ll x=a; x<b; x++) {
			left[x][c] = true;
		}
	}
	rep(i,M){
		ll d = compX.get(D[i]);
		ll e = compY.get(E[i]);
		ll f = compY.get(F[i]);
		for(ll y=e; y<f; y++) {
			up[d][y] = true;
		}
	}
	debug(up);
	debug(left);
	

	auto encode = [&](ll x, ll y){ return x*(compY.size()-1)+y; };
	UnionFind uf(size);
	// 線が引いていないところを連結
	for(ll i=0; i<(ll)compX.size()-1; i++) for(ll j=0; j<(ll)compY.size()-1; j++){
		if(i>0 && !up[i][j]) uf.unite(encode(i, j), encode(i-1, j));
		if(j>0 && !left[i][j]) uf.unite(encode(i, j), encode(i, j-1));
	}
	debug(uf.v);
	
	ll x0=findx(0);
	ll y0=findy(0);
	//ll x0=compX.get(0);
	//ll y0=compY.get(0);
	rep(i,compX.size()-1){
		if(uf.is_same(encode(x0,y0), encode(i,0)) || uf.is_same(encode(x0,y0), encode(i,compY.size()-2))){
			p("INF");return;
		}
	}
	rep(j,compY.size()-1){
		if(uf.is_same(encode(x0,y0), encode(0,j)) || uf.is_same(encode(x0,y0), encode(compX.size()-2, j))){
			p("INF");return;
		}
	}

	auto lenx = [&](ll x)->ll{ return compX[x+1] - compX[x]; };
	auto leny = [&](ll y)->ll{ return compY[y+1] - compY[y]; };
	ll ans=0;
	rep(i,compX.size()-1) rep(j,compY.size()-1) {
		if(uf.is_same(encode(x0,y0), encode(i,j))){
			ans+=lenx(i)*leny(j);
		}
	}
	p(ans);
}

signed main() {
	std::cin.tie(nullptr);
	std::ios::sync_with_stdio(false);
	//ll Q; cin >> Q; while(Q--)solve();
	solve();
	return 0;
}


Measured memory_bytes: 76316