#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T = int > using OSI = ostream_iterator< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )

#define SZ( v ) ( (int)( v ).size() )
#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

constexpr auto INF = LIM<>::max() / 2;

class DisjointSetForest
{
private:
	const int N;

	vector<int> parent;
	vector<int> rank;

	int groups_;
	std::vector< int > sizes;

public:
	DisjointSetForest( int n ) : N( n ), parent( N ), rank( N, 0 ), groups_( N ), sizes( N, 1 )
	{
		std::iota( parent.begin(), parent.end(), 0 );

		return;
	}

	int find( int x )
	{
		if ( parent[x] == x )
		{
			return x;
		}
		return parent[x] = find( parent[x] );
	}

	bool same( int x, int y )
	{
		return find( x ) == find( y );
	}

	bool unite( int x, int y )
	{
		x = find( x );
		y = find( y );

		if ( x == y )
		{
			return false;
		}

		if ( rank[x] < rank[y] )
		{
			parent[x] = y;
			sizes[y] += sizes[x];
		}
		else
		{
			parent[y] = x;
			sizes[x] += sizes[y];

			if ( rank[x] == rank[y] )
			{
				++rank[x];
			}
		}

		--groups_;
		return true;
	}

	int groups() const
	{
		return groups_;
	}

	int groupSize( const int x )
	{
		return sizes[ find( x ) ];
	}
};
// DisjointSetForest( N )
// find( x )
// same( x, y )
// unite( x, y )
// groups()
// groupSize( x )

VI compress( const VI &a, const VI &b, const VI &c )
{
	VI res{ -INF, 0, INF };
	copy( ALL( a ), BI( res ) );
	copy( ALL( b ), BI( res ) );
	copy( ALL( c ), BI( res ) );

	sort( ALL( res ) );
	res.erase( unique( ALL( res ) ), end( res ) );

	return res;
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N, M );
	VI A( N ), B( N ), C( N ), D( M ), E( M ), F( M );
	REP( i, N )
	{
		cin >> A[i] >> B[i] >> C[i];
	}
	REP( i, M )
	{
		cin >> D[i] >> E[i] >> F[i];
	}

	const VI ys = compress( A, B, D );
	const VI xs = compress( C, E, F );

	const int H = SZ( ys );
	const int W = SZ( xs );

	VVI right_bounded( H, VI( W ) ), down_bounded( H, VI( W ) );
	REP( i, N )
	{
		const int idx_x = --lower_bound( ALL( xs ), C[i] ) - begin( xs );
		const int idx_y1 = lower_bound( ALL( ys ), A[i] ) - begin( ys );
		const int idx_y2 = lower_bound( ALL( ys ), B[i] ) - begin( ys );
		REP( j, idx_y1, idx_y2 )
		{
			right_bounded[j][ idx_x ] = true;
		}
	}
	REP( i, M )
	{
		const int idx_y = --lower_bound( ALL( ys ), D[i] ) - begin( ys );
		const int idx_x1 = lower_bound( ALL( xs ), E[i] ) - begin( xs );
		const int idx_x2 = lower_bound( ALL( xs ), F[i] ) - begin( xs );
		REP( j, idx_x1, idx_x2 )
		{
			down_bounded[ idx_y ][j] = true;
		}
	}

	DisjointSetForest dsf( H * W );
	const auto grid_id = [&]( const int y, const int x )
	{
		return y * W + x;
	};

	REP( i, H )
	{
		REP( j, W )
		{
			if ( i + 1 < H && !down_bounded[i][j] )
			{
				dsf.unite( grid_id( i, j ), grid_id( i + 1, j ) );
			}
			if ( j + 1 < W && !right_bounded[i][j] )
			{
				dsf.unite( grid_id( i, j ), grid_id( i, j + 1 ) );
			}
		}
	}

	const int idx_y0 = lower_bound( ALL( ys ), 0 ) - begin( ys );
	const int idx_x0 = lower_bound( ALL( xs ), 0 ) - begin( xs );

	if ( dsf.same( 0, grid_id( idx_y0, idx_x0 ) ) )
	{
		cout << "INF" << endl;
		return 0;
	}

	LL res = 0;
	REP( i, H )
	{
		REP( j, W )
		{
			if ( !dsf.same( grid_id( i, j ), grid_id( idx_y0, idx_x0 ) ) )
			{
				continue;
			}

			const LL dy = ys[ i + 1 ] - ys[i];
			const LL dx = xs[ j + 1 ] - xs[j];
			res += dy * dx;
		}
	}

	cout << res << endl;

	return 0;
}

Measured memory_bytes: 179788