#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
void Pr(bool f) {
  cout << (f ? "Yes" : "No") << "\n";
  exit(0);
}
template <typename T>
vector<T> CoordinateCompression(const vector<T> &x, int offset = 0) {
  int n = x.size();
  vector<T> y = x, ret(n);
  sort(y.begin(), y.end());
  y.erase(unique(y.begin(), y.end()), y.end());
  for (int i = 0; i < n; i++) {
    ret[i] = lower_bound(y.begin(), y.end(), x[i]) - y.begin() + offset;
  }
  return ret;
}
template <typename T>
vector<T> CoordinateCompression(const vector<T> &x, vector<T> &unzip,
                                int offset = 0) {
  int n = x.size();
  vector<T> ret(n);
  unzip = x;
  sort(unzip.begin(), unzip.end());
  unzip.erase(unique(unzip.begin(), unzip.end()), unzip.end());
  for (int i = 0; i < n; i++) {
    ret[i] =
        lower_bound(unzip.begin(), unzip.end(), x[i]) - unzip.begin() + offset;
  }
  return ret;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  vll xl, yl, xlu, ylu;
  xl.emplace_back(0);
  yl.emplace_back(0);
  ll n, m;
  cin >> n >> m;
  vll a(n), b(n), c(n);
  for (ll i = 0, i_end = (n); i < i_end; i++) {
    cin >> a[i] >> b[i] >> c[i];
    xl.emplace_back(a[i]);
    xl.emplace_back(b[i]);
    yl.emplace_back(c[i]);
  }
  vll d(m), e(m), f(m);
  for (ll i = 0, i_end = (m); i < i_end; i++) {
    cin >> d[i] >> e[i] >> f[i];
    xl.emplace_back(d[i]);
    yl.emplace_back(e[i]);
    yl.emplace_back(f[i]);
  }
  xl = CoordinateCompression(xl, xlu, 1);
  yl = CoordinateCompression(yl, ylu, 1);
  unordered_map<ll, vp> xs, ys;
  {
    ll p = 1, q = 1;
    for (ll i = 0, i_end = (n); i < i_end; i++) {
      a[i] = xl[p];
      p++;
      b[i] = xl[p];
      p++;
      c[i] = yl[q];
      q++;
      xs[c[i]].emplace_back(a[i], b[i]);
    }
    for (ll i = 0, i_end = (m); i < i_end; i++) {
      d[i] = xl[p];
      p++;
      e[i] = yl[q];
      q++;
      f[i] = yl[q];
      q++;
      ys[d[i]].emplace_back(e[i], f[i]);
    }
  }
  vvi visited(3010, vi(3010, 0));
  vvi value(3010, vi(3010, 0));
  ((void)0);
  for (ll i = 0, i_end = (((ll)(xlu).size()) - 1); i < i_end; i++)
    for (ll j = 0, j_end = (((ll)(ylu).size()) - 1); j < j_end; j++) {
      value[i][j] = (xlu[i + 1] - xlu[i]) * (ylu[j + 1] - ylu[j]);
    }
  ll ans = 0;
  auto bfs = [&](int si, int sj) -> void {
    queue<pll> q;
    q.emplace(si, sj);
    visited[si][sj] = 1;
    while (q.size()) {
      auto fr = q.front();
      q.pop();
      ll x = fr.first;
      ll y = fr.second;
      if (x == 0 || x == 3009 || y == 0 || y == 3009) {
        print("INF");
        exit(0);
      }
      ans += value[x - 1][y - 1];
      if (!visited[x][y - 1]) {
        bool ff = 1;
        for (auto &&ee : xs[y]) {
          if (ee.first <= x && x < ee.second) {
            ff = 0;
            break;
          }
        }
        if (ff) {
          visited[x][y - 1] = 1;
          q.emplace(x, y - 1);
        }
      }
      if (!visited[x][y + 1]) {
        bool ff = 1;
        for (auto &&ee : xs[y + 1]) {
          if (ee.first <= x && x < ee.second) {
            ff = 0;
            break;
          }
        }
        if (ff) {
          visited[x][y + 1] = 1;
          q.emplace(x, y + 1);
        }
      }
      if (!visited[x - 1][y]) {
        bool ff = 1;
        for (auto &&ee : ys[x]) {
          if (ee.first <= y && y < ee.second) {
            ff = 0;
            break;
          }
        }
        if (ff) {
          visited[x - 1][y] = 1;
          q.emplace(x - 1, y);
        }
      }
      if (!visited[x + 1][y]) {
        bool ff = 1;
        for (auto &&ee : ys[x + 1]) {
          if (ee.first <= y && y < ee.second) {
            ff = 0;
            break;
          }
        }
        if (ff) {
          visited[x + 1][y] = 1;
          q.emplace(x + 1, y);
        }
      }
    }
  };
  bfs(xl[0], yl[0]);
  print(ans);
}
