#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class S, class T>
ostream& operator<<(ostream& os, const pair<S, T> v) {
  os << "(" << v.first << ", " << v.second << ")";
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T> v) {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i > 0) {
      os << " ";
    }
    os << v[i];
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<vector<T>> v) {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i > 0) {
      os << endl;
    }
    os << v[i];
  }
  return os;
}
template <typename T>
void debug(vector<vector<T>>& v, long long h, long long w) {
  for (long long i = 0; i < h; i++) {
    cerr << v[i][0];
    for (long long j = 1; j < w; j++) cerr << " " << v[i][j];
    cerr << endl;
  }
};
template <typename T>
void debug(vector<T>& v, long long n) {
  if (n != 0) cerr << v[0];
  for (long long i = 1; i < n; i++) cerr << " " << v[i];
  cerr << endl;
};
vector<vector<int>> grid_bfs(const vector<string>& S, const char start,
                             const char wall) {
  const int num_dir = 4;
  const int dx[] = {0, -1, 0, 1};
  const int dy[] = {1, 0, -1, 0};
  const int H = S.size();
  const int W = S[0].size();
  vector<vector<int>> dist(H, vector<int>(W, -1));
  queue<pair<int, int>> qu;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      if (S[i][j] == start) {
        qu.emplace(i, j);
        dist[i][j] = 0;
      }
    }
  }
  while (!qu.empty()) {
    auto p = qu.front();
    qu.pop();
    for (int idx = 0; idx < num_dir; idx++) {
      int ni = p.first + dx[idx];
      int nj = p.second + dy[idx];
      if (ni < 0 or nj < 0 or ni > H - 1 or nj > W - 1) continue;
      if (dist[ni][nj] != -1) continue;
      if (S[ni][nj] == wall) continue;
      dist[ni][nj] = dist[p.first][p.second] + 1;
      qu.emplace(ni, nj);
    }
  }
  return dist;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long N, M;
  cin >> N >> M;
  vector<long long> A(N), B(N), C(N), D(M), E(M), F(M);
  for (long long i = 0; i < (long long)N; i++) cin >> A[i] >> B[i] >> C[i];
  for (long long i = 0; i < (long long)M; i++) cin >> D[i] >> E[i] >> F[i];
  vector<long long> xs, ys;
  xs.push_back(0);
  ys.push_back(0);
  for (long long i = 0; i < (long long)N; i++) {
    xs.push_back(A[i]);
    xs.push_back(B[i]);
    ys.push_back(C[i]);
  }
  for (long long i = 0; i < (long long)M; i++) {
    xs.push_back(D[i]);
    ys.push_back(E[i]);
    ys.push_back(F[i]);
  }
  auto compress = [](vector<long long>& X) {
    map<long long, long long> mp;
    sort(X.begin(), X.end());
    X.erase(unique(X.begin(), X.end()), X.end());
    long long cnt = 0;
    for (auto x : X) {
      mp[x] = cnt;
      cnt++;
    }
    return mp;
  };
  auto mpx = compress(xs);
  auto mpy = compress(ys);
  long long Nx = mpx.size();
  long long Ny = mpy.size();
  const long long INF = (1ll << 60);
  vector<long long> Xs, Ys;
  Xs.push_back(INF);
  for (long long i = 0; i < (long long)Nx; i++) {
    Xs.push_back(0);
    if (i != Nx - 1) {
      Xs.push_back(xs[i + 1] - xs[i]);
    }
  }
  Xs.push_back(INF);
  Ys.push_back(INF);
  for (long long i = 0; i < (long long)Nx; i++) {
    Ys.push_back(0);
    if (i != Ny - 1) {
      Ys.push_back(ys[i + 1] - ys[i]);
    }
  }
  Ys.push_back(INF);
  long long H = Xs.size();
  long long W = Ys.size();
  vector<string> S(H);
  for (long long i = 0; i < (long long)H; i++) {
    for (long long j = 0; j < (long long)W; j++) S[i].push_back('.');
  }
  for (long long i = 0; i < (long long)N; i++) {
    long long h1 = 2 * mpx[A[i]] + 1;
    long long h2 = 2 * mpx[B[i]] + 1;
    long long w1 = 2 * mpy[C[i]] + 1;
    for (long long h = h1; h <= h2; h++) S[h][w1] = '#';
  }
  for (long long i = 0; i < (long long)M; i++) {
    long long h1 = 2 * mpx[D[i]] + 1;
    long long w1 = 2 * mpy[E[i]] + 1;
    long long w2 = 2 * mpy[F[i]] + 1;
    for (long long w = w1; w <= w2; w++) S[h1][w] = '#';
  }
  S[2 * mpx[0] + 1][2 * mpy[0] + 1] = 'S';
  auto dist = grid_bfs(S, 'S', '#');
  long long res = 0;
  for (long long i = 0; i < (long long)H; i++) {
    for (long long j = 0; j < (long long)W; j++) {
      if (dist[i][j] >= 0) {
        if (i == 0 or i == H - 1 or j == 0 or j == W - 1) {
          cout << "INF" << endl;
          return 0;
        }
        res += Xs[i] * Ys[j];
      }
    }
  }
  cout << res << endl;
  return 0;
}
