#include <bits/stdc++.h>
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>>>;
bool paircomp(const pair<ll, ll> &a, const pair<ll, ll> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
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);
  for (ll i = 0; i < (N); i++) {
    cin >> A[i] >> B[i] >> C[i];
    X.push_back(A[i]);
    X.push_back(B[i]);
    Y.push_back(C[i]);
  }
  for (ll i = 0; i < (M); i++) {
    cin >> D[i] >> E[i] >> F[i];
    X.push_back(D[i]);
    Y.push_back(E[i]);
    Y.push_back(F[i]);
  }
  sort((X).begin(), (X).end());
  X.erase(unique((X).begin(), (X).end()), end(X));
  sort((Y).begin(), (Y).end());
  Y.erase(unique((Y).begin(), (Y).end()), end(Y));
  ll zero_x = 2 * (lower_bound((X).begin(), (X).end(), 0) - begin(X));
  ll zero_y = 2 * (lower_bound((Y).begin(), (Y).end(), 0) - begin(Y));
  for (ll i = 0; i < (N); i++) {
    A[i] = 2 * (lower_bound((X).begin(), (X).end(), A[i]) - begin(X));
    B[i] = 2 * (lower_bound((X).begin(), (X).end(), B[i]) - begin(X));
    C[i] = 2 * (lower_bound((Y).begin(), (Y).end(), C[i]) - begin(Y));
  }
  for (ll i = 0; i < (M); i++) {
    D[i] = 2 * (lower_bound((X).begin(), (X).end(), D[i]) - begin(X));
    E[i] = 2 * (lower_bound((Y).begin(), (Y).end(), E[i]) - begin(Y));
    F[i] = 2 * (lower_bound((Y).begin(), (Y).end(), F[i]) - begin(Y));
  }
  vector<vector<char>> visited(X.size() * 2 + 1,
                               vector<char>(Y.size() * 2 + 1));
  for (ll i = 0; i < (N); i++)
    for (ll x = (A[i]); x < (B[i] + 1); x++) visited[x][C[i]] = 1;
  for (ll i = 0; i < (M); i++)
    for (ll y = (E[i]); y < (F[i] + 1); y++) visited[D[i]][y] = 1;
  stack<pair<ll, ll>> 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;
    }
    for (ll i = 0; i < (4); i++) {
      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;
  for (ll i = 0; i < (X.size() - 1); i++)
    for (ll j = 0; j < (Y.size() - 1); j++) {
      if (visited[i * 2 + 1][j * 2 + 1])
        ans += (X[i + 1] - X[i] * (Y[j + 1] - Y[j]));
    }
  cout << ans << endl;
  return 0;
}
