#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
template <typename T>
void show1dvec(const vector<T> &v) {
  if (v.size() == 0) return;
  int n = v.size() - 1;
  for (int i = 0; i < (int)(n); i++) cout << v[i] << wsp;
  cout << v[n] << rt;
  return;
}
template <typename T>
void show2dvec(const vector<vector<T>> &v) {
  int n = v.size();
  for (int i = 0; i < (int)(n); i++) show1dvec(v[i]);
}
template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v) {
  int n = v.size();
  for (int i = 0; i < (int)(n); i++)
    cout << v[i].first << wsp << v[i].second << rt;
  return;
}
template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) {
  int n = v.size();
  for (int i = 0; i < (int)(n); i++) {
    t.push_back(v[i].first);
    s.push_back(v[i].second);
  }
  return;
}
template <typename T>
void maxvec(vector<T> &v) {
  T s = v[0];
  int n = v.size();
  for (int i = 0; i < (int)(n - 1); i++) {
    if (s > v[i + 1]) {
      v[i + 1] = s;
    }
    s = v[i + 1];
  }
}
template <typename T, typename S>
bool myfind(T t, S s) {
  return find(t.cbegin(), t.cend(), s) != t.cend();
}
bool check(int y, int x, int h, int w) {
  return 0 <= y && y < h && 0 <= x && x < w;
}
template <typename T>
vector<T> cumsum(const vector<T> &v) {
  T s = 0;
  vector<T> ret;
  for (int i = 0; i < (int)(v.size()); i++) {
    s += v[i];
    s %= mod;
    ret.emplace_back(s);
  }
  return ret;
}
bool iskadomatsu(int a, int b, int c) {
  return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}
VS split(string s, char c) {
  VS ret;
  string part;
  s += c;
  for (int i = 0; i < (int)(s.length()); i++) {
    if (s[i] == c) {
      ret.emplace_back(part);
      part = "";
    } else if (s[i] != c) {
      part += s[i];
    }
  }
  return ret;
}
string removezero(string &s) {
  string ret;
  for (auto z : s)
    if (z != '0') ret += z;
  return ret;
}
ll sumdigit(ll x) {
  ll ans{0};
  while (x > 0) {
    ans += x % 10;
    x /= 10;
  }
  return ans;
}
template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll) {
  ll ret = 1, r = p;
  while (q) {
    if (q % 2) ret *= r, ret %= mod;
    r = (r * r) % mod, q /= 2;
  }
  return ret % mod;
}
void make_frac_tables(VL &frac_list, VL &frac_inv_list) {
  for (int i = 0; i < (int)(frac_list.size() - 1); i++) {
    frac_list[i + 1] *= frac_list[i] * (i + 1);
    frac_list[i + 1] %= mod;
    frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
    frac_inv_list[i + 1] %= mod;
  }
}
ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) {
  if (a < b) return 0;
  ll ret = frac_list[a];
  ret *= frac_inv_list[b];
  ret %= mod;
  ret *= frac_inv_list[a - b];
  ret %= mod;
  return ret;
}
void shave(vector<int> &v, int n) {
  vector<int> x, y;
  int n_sq = sqrt(n) + 1;
  for (int i = 3; i < n + 1; i += 2) {
    x.emplace_back(i);
  }
  for (int i = 3; i < n_sq; i += 2) {
    for (auto itr = x.begin(); itr != x.end(); itr++) {
      if (*itr == i || *itr % i != 0) y.emplace_back(*itr);
    }
    x.clear();
    x = y;
    y.clear();
  }
  if (n >= 2) v.emplace_back(2);
  for (auto itr = x.begin(); itr != x.end(); itr++) {
    v.emplace_back(*itr);
  }
}
void compress(vector<int> &x, VI &unzip, map<int, int> &zip) {
  sort(x.begin(), x.end());
  x.erase(unique(x.begin(), x.end()), x.end());
  unzip.resize(x.size());
  for (int i = 0; i < x.size(); i++) {
    zip[x[i]] = i;
    unzip[i] = x[i];
  }
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  const int l = -1e9 - 1;
  const int r = 1e9 + 1;
  int n, m, y, x, a, b, c, d, e, f, t;
  ll ans{0};
  cin >> n >> m;
  vector<tuple<int, int, int>> x_pallarel, y_pallarel;
  VI x_list{l}, y_list{l};
  map<int, int> zipx, zipy;
  VI unzipx, unzipy;
  int xs, ys;
  for (int i = 0; i < (int)(n); i++) {
    cin >> a >> b >> c;
    y_pallarel.emplace_back(make_tuple(a, b, c));
    x_list.emplace_back(a);
    x_list.emplace_back(b);
    y_list.emplace_back(c);
  }
  for (int i = 0; i < (int)(m); i++) {
    cin >> d >> e >> f;
    x_pallarel.emplace_back(make_tuple(d, e, f));
    x_list.emplace_back(d);
    y_list.emplace_back(e);
    y_list.emplace_back(f);
  }
  x_list.emplace_back(r), y_list.emplace_back(r);
  compress(x_list, unzipx, zipx);
  compress(y_list, unzipy, zipy);
  xs = x_list.size();
  ys = y_list.size();
  VVI field(ys, VI(xs, 1));
  vector<VB> moveable(ys, VB(xs, false));
  for (int i = 0; i < (int)(n); i++) {
    a = get<0>(y_pallarel[i]);
    b = get<1>(y_pallarel[i]);
    c = get<2>(y_pallarel[i]);
    for (int j = (zipx[a]); j < (int)(zipx[b]); j++) {
      field[zipy[c]][j] *= 3;
      field[zipy[c] - 1][j] *= 7;
    }
  }
  for (int i = 0; i < (int)(m); i++) {
    d = get<0>(x_pallarel[i]);
    e = get<1>(x_pallarel[i]);
    f = get<2>(x_pallarel[i]);
    for (int j = (zipy[e]); j < (int)(zipy[f]); j++) {
      field[j][zipx[d]] *= 2;
      field[j][zipx[d] - 1] *= 5;
    }
  }
  vector<PII> search, new_search;
  for (int i = 0; i < (int)(ys - 1); i++)
    for (int j = 0; j < (int)(xs - 1); j++) {
      if (x_list[i] <= 0 && x_list[i + 1] > 0 && y_list[j] <= 0 &&
          y_list[j + 1] > 0) {
        search.emplace_back(make_pair(i, j));
        moveable[i][j] = 1;
        break;
      }
    }
  while (!search.empty()) {
    for (auto [cy, cx] : search) {
      if (check(cy - 1, cx, ys, xs) && field[cy][cx] % 3 != 0 &&
          moveable[cy - 1][cx] == 0) {
        moveable[cy - 1][cx] = 1;
        new_search.emplace_back(make_pair(cy - 1, cx));
      }
      if (check(cy + 1, cx, ys, xs) && field[cy][cx] % 7 != 0 &&
          moveable[cy + 1][cx] == 0) {
        moveable[cy + 1][cx] = 1;
        new_search.emplace_back(make_pair(cy + 1, cx));
      }
      if (check(cy, cx - 1, ys, xs) && field[cy][cx] % 2 != 0 &&
          moveable[cy][cx - 1] == 0) {
        moveable[cy][cx - 1] = 1;
        new_search.emplace_back(make_pair(cy, cx - 1));
      }
      if (check(cy, cx + 1, ys, xs) && field[cy][cx] % 5 != 0 &&
          moveable[cy][cx + 1] == 0) {
        moveable[cy][cx + 1] = 1;
        new_search.emplace_back(make_pair(cy, cx + 1));
      }
    }
    search.clear();
    search = new_search;
    new_search.clear();
  }
  int outcage = 0;
  for (int i = 0; i < (int)(ys); i++) {
    outcage += moveable[i][0];
    outcage += moveable[i][xs - 1];
  }
  for (int i = 0; i < (int)(xs); i++) {
    outcage += moveable[0][i];
    outcage += moveable[ys - 1][i];
  }
  if (outcage) {
    cout << "INF" << rt;
    return 0;
  }
  for (int i = 0; i < (int)(ys); i++)
    for (int j = 0; j < (int)(xs); j++)
      if (moveable[i][j]) {
        ans += 1ll * (x_list[j + 1] - x_list[j]) * (y_list[i + 1] - y_list[i]);
      }
  cout << ans << rt;
  return 0;
}
