#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
constexpr int INF = INT_MAX / 2;
constexpr long long LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
inline long long gcd(long long a, long long b) {
  while (b) {
    long long c = a;
    a = b;
    b = c % b;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool isprime(long long n) {
  if (n == 1) return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
template <typename T>
T mypow(T a, unsigned int b) {
  if (!b) return T(1);
  if (b & 1) return mypow(a, b - 1) * a;
  T memo = mypow(a, b >> 1);
  return memo * memo;
}
long long modpow(long long a, long long b, long long m) {
  if (!b) return 1;
  if (b & 1) return modpow(a, b - 1, m) * a % m;
  long long memo = modpow(a, b >> 1, m);
  return memo * memo % m;
}
template <typename T>
void printArray(std::vector<T>& vec) {
  for (int i = 0; i < (long long)(vec.size() - 1); i++)
    std::cout << vec[i] << " ";
  std::cout << vec.back() << std::endl;
}
template <typename T>
void printArray(T l, T r) {
  T rprev = r;
  rprev--;
  for (T i = l; i != rprev; i++) {
    std::cout << *i << " ";
  }
  std::cout << *rprev << std::endl;
}
template <typename T>
class Compression {
  std::vector<T> vec;
  bool built = false;

 public:
  Compression() {}
  Compression(const std::vector<T> initvec) : vec(initvec) {}
  void push(T val) { vec.emplace_back(val); }
  void build() {
    std::sort(vec.begin(), vec.end());
    vec.erase(std::unique(vec.begin(), vec.end()), vec.end());
    built = true;
  }
  int operator[](T val) {
    assert(built);
    return std::lower_bound(vec.begin(), vec.end(), val) - vec.begin();
  }
  T at(int p) { return vec[p]; }
  unsigned int size() { return vec.size(); }
};
int n, m, a[1010], b[1010], c[1010], d[1010], e[1010], f[1010];
int grid[4010][4010];
bool used[4010][4010];
std::vector<int> xvec, yvec;
Compression<int> xcomp, ycomp;
long long ans;
int g[] = {0, 1, 0, -1};
int h[] = {1, 0, -1, 0};
void dfs(int x, int y) {
  used[x][y] = true;
  if (x == 0 || y == 0 || x == xcomp.size() || y == ycomp.size()) {
    puts("INF");
    exit(0);
  }
  int hl = (xcomp.at(x + 1) - xcomp.at(x)) / 2,
      wl = (ycomp.at(y + 1) - ycomp.at(y)) / 2;
  if (xcomp.at(x) % 2) hl++;
  if (ycomp.at(y) % 2) wl++;
  ans += hl * wl;
  for (int i = 0; i < (long long)(4); i++) {
    int nx = x + g[i], ny = y + h[i];
    if (nx < 0 || xcomp.size() <= nx || ny < 0 || ycomp.size() <= ny) continue;
    if (!grid[nx][ny] && !used[nx][ny]) dfs(nx, ny);
  }
}
int main() {
  std::cin >> n >> m;
  xcomp.push(-INF);
  xcomp.push(0);
  xcomp.push(INF);
  ycomp.push(-INF);
  ycomp.push(0);
  ycomp.push(INF);
  for (int i = 0; i < (long long)(n); i++) {
    std::cin >> a[i] >> b[i] >> c[i];
    a[i] *= 2;
    b[i] *= 2;
    c[i] *= 2;
    xcomp.push(a[i]);
    xcomp.push(b[i] + 1);
    ycomp.push(c[i]);
    ycomp.push(c[i] + 1);
  }
  for (int i = 0; i < (long long)(m); i++) {
    std::cin >> d[i] >> e[i] >> f[i];
    d[i] *= 2;
    e[i] *= 2;
    f[i] *= 2;
    ycomp.push(e[i]);
    ycomp.push(f[i] + 1);
    xcomp.push(d[i]);
    xcomp.push(d[i] + 1);
  }
  xcomp.build();
  ycomp.build();
  for (int i = 0; i < (long long)(n); i++) {
    grid[xcomp[a[i]]][ycomp[c[i]]]++;
    grid[xcomp[b[i] + 1]][ycomp[c[i]]]--;
    grid[xcomp[a[i]]][ycomp[c[i] + 1]]--;
    grid[xcomp[b[i] + 1]][ycomp[c[i] + 1]]++;
  }
  for (int i = 0; i < (long long)(m); i++) {
    grid[xcomp[d[i]]][ycomp[e[i]]]++;
    grid[xcomp[d[i]]][ycomp[f[i] + 1]]--;
    grid[xcomp[d[i] + 1]][ycomp[e[i]]]--;
    grid[xcomp[d[i] + 1]][ycomp[f[i] + 1]]++;
  }
  for (int i = 0; i < (long long)(xcomp.size() - 1); i++) {
    for (int j = 0; j < (long long)(ycomp.size()); j++)
      grid[i + 1][j] += grid[i][j];
  }
  for (int i = 0; i < (long long)(xcomp.size()); i++) {
    for (int j = 0; j < (long long)(ycomp.size() - 1); j++)
      grid[i][j + 1] += grid[i][j];
  }
  dfs(xcomp[0], ycomp[0]);
  std::cout << ans << std::endl;
  return 0;
}
