#pragma region template
#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>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
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;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
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)...);
}
#pragma endregion

void Pr(bool f){
  cout << (f ? "Yes" : "No") << "\n";
  exit(0);
}

// {10, 3, 1, -5, 1} -> {3, 2, 1, 0, 1} + offset
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;
}

// {10, 3, 1, -5, 1} -> {3, 2, 1, 0, 1} + offset
// unzip: {-5, 1, 3, 10}
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);
  rep(i, n){
    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);
  rep(i, m){
    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;
    rep(i, n){
      a[i] = xl[p]; p++;
      b[i] = xl[p]; p++;
      c[i] = yl[q]; q++;
      xs[c[i]].emplace_back(a[i], b[i]);
    }
    rep(i, m){
      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));
  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);
      }
      if(0 < x && x < SZ(xlu)
      && 0 < y && y < SZ(ylu))
        ans += (xlu[x]-xlu[x-1])*(ylu[y]-ylu[y-1]);
      // left
      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);
        }
      }
      // right
      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);
        }
      }
      // up
      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);
        }
      }
      // down
      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);
}


Measured memory_bytes: 39708