#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

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

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N, M;
  cin >> N >> M;
  vl A(N), B(N), C(N), D(M), E(M), F(M);
  vl X, Y;
  X.push_back(0);
  Y.push_back(0);
  REP(i, N) {
    cin >> A[i] >> B[i] >> C[i];
    X.push_back(A[i]);
    X.push_back(B[i]);
    Y.push_back(C[i]);
  }
  REP(i, M) {
    cin >> D[i] >> E[i] >> F[i];
    X.push_back(D[i]);
    Y.push_back(E[i]);
    Y.push_back(F[i]);
  }
  sort(ALL(X));
  X.erase(unique(ALL(X)), end(X));
  sort(ALL(Y));
  Y.erase(unique(ALL(Y)), end(Y));

  ll zero_x = 2 * (lower_bound(ALL(X), 0) - begin(X));
  ll zero_y = 2 * (lower_bound(ALL(Y), 0) - begin(Y));
  REP(i, N) {
    A[i] = 2 * (lower_bound(ALL(X), A[i]) - begin(X));
    B[i] = 2 * (lower_bound(ALL(X), B[i]) - begin(X));
    C[i] = 2 * (lower_bound(ALL(Y), C[i]) - begin(Y));
  }
  REP(i, M) {
    D[i] = 2 * (lower_bound(ALL(X), D[i]) - begin(X));
    E[i] = 2 * (lower_bound(ALL(Y), E[i]) - begin(Y));
    F[i] = 2 * (lower_bound(ALL(Y), F[i]) - begin(Y));
  }
  vector<vector<char>> visited(X.size() * 2 + 1,
                               vector<char>(Y.size() * 2 + 1));
  REP(i, N) FOR(x, A[i], B[i] + 1) visited[x][C[i]] = 1;
  REP(i, M) FOR(y, E[i], F[i] + 1) visited[D[i]][y] = 1;

  stack<pll> S;
  visited[zero_x][zero_y] = 1;
  S.emplace(zero_x, zero_y);

  while (!S.empty()) {
    auto [x, y] = S.top();
    S.pop();
    if (x == 0 || x == X.size() * 2 || y == 0 || y == Y.size() * 2) {
      cout << "INF" << endl;
      return 0;
    }
    REP(i, 4) {
      ll nx = x + dx[i];
      ll ny = y + dy[i];
      if (0 <= nx && nx < X.size() * 2 + 1 && 0 <= ny &&
          ny < Y.size() * 2 + 1 && !visited[nx][ny]) {
        visited[nx][ny] = 1;
        S.emplace(nx, ny);
      }
    }
  }
  ll ans = 0;
  REP(i, X.size() - 1) REP(j, Y.size() - 1) {
    if (visited[i * 2 + 1][j * 2 + 1])
      ans += (X[i + 1] - X[i]) * (Y[j + 1] - Y[j]);
  }
  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 198972