#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() = default;
	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();
	}
};

class Area2D {
public:
	vector<array<ll,4>> lines;
	Compress<ll> compX, compY;
	// 圧縮後の座標の、up: 真上に線がある/ left: 真左に線がある
	vector<vector<bool>> up, left;
	// 圧縮後領域の接続状況
	UnionFind uf;
	// 圧縮後領域のx,y方向それぞれの数
	ll sizeX, sizeY;

	Area2D(){}

	//(x0,y0)-(x1,y1)に直線を引く
	void addEdge(ll x0, ll y0, ll x1, ll y1){
		if(x0==x1 && y0==y1) return;
		if(x0==x1 && y0>y1) swap(y0, y1);
		if(y0==y1 && x0>x1) swap(x0, x1);
		lines.push_back({x0, y0, x1, y1});
	}

	void build(){
		vector<ll> vx{-INF, INF}, vy{-INF, INF};
		for(ll i=0; i<(ll)lines.size(); i++){
			vx.push_back(lines[i][0]);
			vy.push_back(lines[i][1]);
			vx.push_back(lines[i][2]);
			vy.push_back(lines[i][3]);
		}
		compX.add(vx);
		compY.add(vy);
		compX.build();
		compY.build();
		sizeX = compX.size()-1;
		sizeY = compY.size()-1;

		up.assign(sizeX, vector<bool>(sizeY, false));
		left.assign(sizeX, vector<bool>(sizeY, false));
		for(ll i=0; i<(ll)lines.size(); i++){
			if(lines[i][0]==lines[i][2]){
				ll x = compX.get(lines[i][0]);
				ll ybegin = compY.get(lines[i][1]);
				ll yend = compY.get(lines[i][3]);
				for(ll y=ybegin; y<yend; y++) up[x][y] = true;
			}else{
				ll y = compY.get(lines[i][1]);
				ll xbegin = compX.get(lines[i][0]);
				ll xend = compX.get(lines[i][2]);
				for(ll x=xbegin; x<xend; x++) left[x][y] = true;
			}
		}

		uf = UnionFind(sizeX * sizeY);
		for(ll i=0; i<sizeX; i++) for(ll j=0; j<sizeY; 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));
		}
	}

	// リアル座標値x,yが圧縮座標のどのインデックスの領域に含まれるかを求める
	ll findX(ll x){
		return compX.get(x) - 1;
	}
	ll findY(ll y){
		return compY.get(y) - 1;
	}

	//領域のインデックスx,yについて、x方向/y方向の長さを返す
	ll lenX(ll x){
		return compX[x+1] - compX[x];
	};
	ll lenY(ll y){
		return compY[y+1] - compY[y];
	};

	//領域のインデックス(x0,y0)と(x1,y1)が接続されているかを返す
	bool is_same(ll x0, ll y0, ll x1, ll y1){
		return uf.is_same(encode(x0,y0), encode(x1,y1));
	}

private:
	//領域のインデックス(x,y)をUnionFind用に1次元に変換
	ll encode(ll x, ll y){
		return x * sizeY + y;
	}
};

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

void solve() {
	ll N,M;
	cin>>N>>M;

	Area2D area;
	rep(i,N){
		//(A,C)-(B,C)
		ll A,B,C;
		cin>>A>>B>>C;
		area.addEdge(A, C, B, C);
	}
	rep(i,M){
		//(D,E)-(D,F)
		ll D,E,F;
		cin>>D>>E>>F;
		area.addEdge(D, E, D, F);
	}

	area.build();

	//座標(0,0)がどの領域インデックスに含まれるか
	ll x0 = area.findX(0);
	ll y0 = area.findY(0);

	rep(i,area.sizeX){
		if(area.is_same(x0,y0,i,0) || area.is_same(x0,y0,i,area.sizeY-1)){
			p("INF");return;
		}
	}
	rep(j,area.sizeY){
		if(area.is_same(x0,y0,0,j) || area.is_same(x0,y0,area.sizeX-1,j)){
			p("INF");return;
		}
	}

	ll ans=0;
	rep(i,area.sizeX) rep(j,area.sizeY) {
		if(area.is_same(x0,y0,i,j)){
			ans += area.lenX(i) * area.lenY(j);
		}
	}
	p(ans);
}

//https://atcoder.jp/contests/abc168/tasks/abc168_f
//https://betrue12.hateblo.jp/entry/2020/05/18/004226
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: 76308