#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
//const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

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

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

struct UnionFind {
  vector< int > data;

  UnionFind(int sz) {
    data.assign(sz, -1);
  }

  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if(x == y) return (false);
    if(data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return (true);
  }

  int find(int k) {
    if(data[k] < 0) return (k);
    return (data[k] = find(data[k]));
  }

  int size(int k) {
    return (-data[find(k)]);
  }
};


int main() {
  int N, M;
  cin >> N >> M;
  vector< int > A(N), B(N), C(N);
  vector< int64 > xs{0, -1, 1, inf, -inf}, ys{0, -1, 1, inf, -inf};
  for(int i = 0; i < N; i++) {
    cin >> A[i] >> B[i] >> C[i];
    for(int j = -1; j <= 1; j++) {
      xs.emplace_back(A[i] + j);
      xs.emplace_back(B[i] + j);
      ys.emplace_back(C[i] + j);
    }
  }
  vector< int > D(M), E(M), F(M);
  for(int i = 0; i < M; i++) {
    cin >> D[i] >> E[i] >> F[i];
    for(int j = -1; j <= 1; j++) {
      xs.emplace_back(D[i] + j);
      ys.emplace_back(E[i] + j);
      ys.emplace_back(F[i] + j);
    }
  }
  sort(begin(xs), end(xs));
  xs.erase(unique(begin(xs), end(xs)), end(xs));
  sort(begin(ys), end(ys));
  ys.erase(unique(begin(ys), end(ys)), end(ys));
  for(int i = 0; i < N; i++) {
    A[i] = lower_bound(begin(xs), end(xs), A[i]) - begin(xs);
    B[i] = lower_bound(begin(xs), end(xs), B[i]) - begin(xs);
    C[i] = lower_bound(begin(ys), end(ys), C[i]) - begin(ys);
  }
  for(int i = 0; i < M; i++) {
    D[i] = lower_bound(begin(xs), end(xs), D[i]) - begin(xs);
    E[i] = lower_bound(begin(ys), end(ys), E[i]) - begin(ys);
    F[i] = lower_bound(begin(ys), end(ys), F[i]) - begin(ys);
  }
  auto matYoko = make_v< int >(ys.size(), xs.size());
  auto matTate = make_v< int >(ys.size(), xs.size());
  for(int i = 0; i < N; i++) {
    matYoko[C[i]][A[i]]++;
    matYoko[C[i]][B[i]]--;
  }
  for(int i = 0; i < M; i++) {
    matTate[E[i]][D[i]]++;
    matTate[F[i]][D[i]]--;
  }
  for(int i = 0; i < ys.size(); i++) {
    for(int j = 1; j < xs.size(); j++) {
      matYoko[i][j] += matYoko[i][j - 1];
    }
  }
  for(int i = 0; i < xs.size(); i++) {
    for(int j = 1; j < ys.size(); j++) {
      matTate[j][i] += matTate[j - 1][i];
    }
  }
  UnionFind uf(ys.size() * xs.size());
  for(int i = 0; i < ys.size(); i++) {
    for(int j = 0; j < xs.size(); j++) {
      if(i) {
        if(matYoko[i][j] == 0) {
          uf.unite(i * xs.size() + j - xs.size(), i * xs.size() + j);

        }
      }
      if(j) {
        if(matTate[i][j] == 0) {
          uf.unite(i * xs.size() + j - 1, i * xs.size() + j);
        }
      }
    }
  }
  int Y = lower_bound(begin(ys), end(ys), 0) - begin(ys);
  int X = lower_bound(begin(xs), end(xs), 0) - begin(xs);
  int64 ret = 0;
  for(int i = 0; i + 1 < ys.size(); i++) {
    for(int j = 0; j + 1 < xs.size(); j++) {
      if(uf.find(i * xs.size() + j) == uf.find(Y * xs.size() + X)) {
        ret += 1LL * (ys[i + 1] - ys[i]) * (xs[j + 1] - xs[j]); // うくうくうくうくうくうく        ret += 1LL * (ys[i + 1] - ys[i]) * (xs[j + 1] - xs[j]); // うくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうくうく

      }
    }
  }
  for(int i = 0; i < xs.size(); i++) {
    if(uf.find(i) == uf.find(Y * xs.size() + X)) {
      cout << "INF\n";
      exit(0);
    }
    if(uf.find((ys.size() - 1) * xs.size() + i) == uf.find(Y * xs.size() + X)) {
      cout << "INF\n";
      exit(0);
    }
  }
  for(int i = 0; i < ys.size(); i++) {
    if(uf.find(i * xs.size()) == uf.find(Y * xs.size() + X)) {
      cout << "INF\n";
      exit(0);
    }
    if(uf.find(i * xs.size() + xs.size() - 1) == uf.find(Y * xs.size() + X)) {
      cout << "INF\n";
      exit(0);
    }
  }
  cout << ret << endl;
}

Measured memory_bytes: 954712