#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
  cout << "Yes" << endl;
  exit(0);
}
inline void no() {
  cout << "No" << endl;
  exit(0);
}
inline i64 gcd(i64 a, i64 b) {
  if (min(a, b) == 0) return max(a, b);
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) {
  if (min(a, b) == 0) return max(a, b);
  return a / gcd(a, b) * b;
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T>
inline void amax(T &x, T y) {
  x = max(x, y);
}
template <typename T>
inline void amin(T &x, T y) {
  x = min(x, y);
}
template <typename T>
inline T exp(T x, i64 n, T e = 1) {
  T r = e;
  while (n > 0) {
    if (n & 1) r *= x;
    x *= x;
    n >>= 1;
  }
  return r;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
  for (int i = 0; i < int(v.size()); i++) {
    if (i) os << ' ';
    os << v[i];
  }
  return os;
}
void solve();
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(16);
  solve();
  return 0;
}
void solve() {
  int n, m;
  cin >> n >> m;
  vi32 a(n), b(n), c(n);
  vi32 d(m), e(m), f(m);
  for (int i = 0; i < int(n); i++) {
    cin >> a[i] >> b[i] >> c[i];
  }
  for (int i = 0; i < int(m); i++) {
    cin >> d[i] >> e[i] >> f[i];
  }
  set<int> xset, yset;
  xset.insert(0);
  yset.insert(0);
  for (int i = 0; i < int(n); i++) {
    xset.insert(a[i]);
    xset.insert(b[i]);
    yset.insert(c[i]);
  }
  for (int i = 0; i < int(m); i++) {
    xset.insert(d[i]);
    yset.insert(e[i]);
    yset.insert(f[i]);
  }
  vi32 xo, yo;
  for (auto s : xset) xo.push_back(s);
  for (auto s : yset) yo.push_back(s);
  int h = ((int)xo.size());
  int w = ((int)yo.size());
  vector<vi32> hg(h + 1, vi32(w));
  vector<vi32> wg(h, vi32(w + 1));
  for (int i = 0; i < int(n); i++) {
    int ai = lower_bound((xo).begin(), (xo).end(), a[i]) - xo.begin();
    int bi = lower_bound((xo).begin(), (xo).end(), b[i]) - xo.begin();
    int ci = lower_bound((yo).begin(), (yo).end(), c[i]) - yo.begin();
    hg[ai][ci] += 1;
    hg[bi][ci] -= 1;
  }
  for (int j = 0; j < int(w); j++)
    for (int i = 1; i <= int(h - 1); i++) {
      hg[i][j] += hg[i - 1][j];
    }
  for (int i = 0; i < int(m); i++) {
    int di = lower_bound((xo).begin(), (xo).end(), d[i]) - xo.begin();
    int ei = lower_bound((yo).begin(), (yo).end(), e[i]) - yo.begin();
    int fi = lower_bound((yo).begin(), (yo).end(), f[i]) - yo.begin();
    wg[di][ei] += 1;
    wg[di][fi] -= 1;
  }
  for (int i = 0; i < int(h); i++)
    for (int j = 1; j <= int(w - 1); j++) {
      wg[i][j] += wg[i][j - 1];
    }
  vector<vi32> seen(h, vi32(w));
  using P = pair<int, int>;
  queue<P> q;
  {
    int ox = lower_bound((xo).begin(), (xo).end(), 0) - xo.begin();
    int oy = lower_bound((yo).begin(), (yo).end(), 0) - yo.begin();
    q.emplace(ox, oy);
    if (ox > 0) q.emplace(ox - 1, oy);
    if (oy > 0) q.emplace(ox, oy - 1);
    if (ox > 0 && oy > 0) q.emplace(ox - 1, oy - 1);
  }
  while (((int)q.size())) {
    int x, y;
    tie(x, y) = q.front();
    q.pop();
    if (seen[x][y]) continue;
    seen[x][y] = 1;
    do {
      if (wg[x][y]) break;
      if (x == 0) {
        cout << "INF" << endl;
        exit(0);
      }
      q.emplace(x - 1, y);
    } while (0);
    do {
      if (wg[x + 1][y]) break;
      if (x + 1 >= h - 1) {
        cout << "INF" << endl;
        exit(0);
      }
      q.emplace(x + 1, y);
    } while (0);
    do {
      if (hg[x][y]) break;
      if (y == 0) {
        cout << "INF" << endl;
        exit(0);
      }
      q.emplace(x, y - 1);
    } while (0);
    do {
      if (hg[x][y + 1]) break;
      if (y + 1 >= w - 1) {
        cout << "INF" << endl;
        exit(0);
      }
      q.emplace(x, y + 1);
    } while (0);
  }
  i64 ans = 0;
  for (int i = 0; i < int(h - 1); i++)
    for (int j = 0; j < int(w - 1); j++) {
      if (seen[i][j]) {
        ans += (i64)(xo[i + 1] - xo[i]) * (yo[j + 1] - yo[j]);
      }
    }
  cout << ans << endl;
}
