#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e3 + 10;
int n, m, limitx, limity;
long long int horizontal[3][maxN], vertical[3][maxN];
map<int, long long int> revx, revy;
int mat[6 * maxN][6 * maxN];
int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};
bool bfs(int sx, int sy) {
  queue<pair<int, int>> q;
  q.push({sx, sy});
  while (!q.empty()) {
    int x = q.front().first, y = q.front().second;
    q.pop();
    if (x < 0 || x >= limitx || y < 0 || y >= limity) return true;
    if (mat[x][y] != 0) continue;
    mat[x][y] = 2;
    for (int k = 0; k < 4; k++) {
      int nx = x + dx[k], ny = y + dy[k];
      if (nx < 0 || nx >= limitx || ny < 0 || ny >= limity) return true;
      if (mat[nx][ny] == 0) q.push({x + dx[k], y + dy[k]});
    }
  }
  return false;
}
void removeRepeated(vector<long long int> &arr) {
  sort(arr.begin(), arr.end());
  arr.resize(distance(arr.begin(), unique(arr.begin(), arr.end())));
}
int main() {
  int t = 0;
  while (scanf("%d %d", &n, &m) != EOF) {
    if (t++) memset(mat, 0, sizeof(mat));
    vector<long long int> xs, ys;
    xs.push_back(0), ys.push_back(0);
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < 3; j++) scanf("%lld", &horizontal[j][i]);
      xs.push_back(horizontal[0][i]), xs.push_back(horizontal[1][i]);
      ys.push_back(horizontal[2][i]);
      assert(horizontal[2][i] >= -1e9 && horizontal[2][i] <= 1e9);
      assert(horizontal[0][i] >= -1e9 && horizontal[0][i] < horizontal[1][i]);
      assert(horizontal[1][i] <= 1e9);
    }
    for (int i = 0; i < m; i++) {
      for (int j = 0; j < 3; j++) scanf("%lld", &vertical[j][i]);
      xs.push_back(vertical[0][i]);
      ys.push_back(vertical[1][i]), ys.push_back(vertical[2][i]);
      assert(vertical[0][i] >= -1e9 && vertical[0][i] <= 1e9);
      assert(vertical[1][i] >= -1e9 && vertical[1][i] < vertical[2][i]);
      assert(vertical[2][i] <= 1e9);
    }
    removeRepeated(xs), removeRepeated(ys);
    map<long long int, int> compx, compy;
    revx.clear(), revy.clear();
    for (int i = 0; i < xs.size(); i++)
      compx[xs[i]] = 2 * i, revx[2 * i] = xs[i];
    for (int i = 0; i < ys.size(); i++)
      compy[ys[i]] = 2 * i, revy[2 * i] = ys[i];
    for (int i = 0; i < n; i++) {
      horizontal[0][i] = compx[horizontal[0][i]],
      horizontal[1][i] = compx[horizontal[1][i]];
      horizontal[2][i] = compy[horizontal[2][i]];
    }
    for (int i = 0; i < m; i++) {
      vertical[0][i] = compx[vertical[0][i]];
      vertical[1][i] = compy[vertical[1][i]],
      vertical[2][i] = compy[vertical[2][i]];
    }
    limitx = 2 * xs.size() + 1, limity = 2 * ys.size() + 1;
    assert(limitx <= 6 * maxN);
    assert(limity <= 6 * maxN);
    for (int i = 0; i < n; i++)
      for (int j = horizontal[0][i]; j <= horizontal[1][i]; j++)
        mat[j][horizontal[2][i]] = 1;
    for (int i = 0; i < m; i++)
      for (int j = vertical[1][i]; j <= vertical[2][i]; j++)
        mat[vertical[0][i]][j] = 1;
    int zerox = compx[0], zeroy = compy[0];
    bool beyond = bfs(zerox, zeroy);
    if (0)
      for (int y = 0; y < limity; y++) {
        for (int x = 0; x < limitx; x++)
          if (x == zerox && y == zeroy)
            printf("x");
          else
            printf("%c", mat[x][y] == 1   ? '@'
                         : mat[x][y] == 2 ? ((x & 1LL & y) ? '~' : '.')
                                          : ' ');
        printf("\n");
      }
    if (beyond)
      printf("INF\n");
    else {
      long long int ans = 0;
      for (int x = 1; x < limitx; x += 2)
        for (int y = 1; y < limity; y += 2)
          if (mat[x][y] == 2) {
            if (0)
              printf("\t(%d, %d) - [%lld - %lld = %lld] [%lld - %lld = %lld]\n",
                     x, y, revx[x + 1], revx[x - 1], revx[x + 1] - revx[x - 1],
                     revy[y + 1], revy[y - 1], revy[y + 1] - revy[y - 1]);
            ans += (revx[x + 1] - revx[x - 1]) * (revy[y + 1] - revy[y - 1]);
            assert(revx[x + 1] - revx[x - 1] >= 0);
            assert(revy[y + 1] - revy[y - 1] >= 0);
          }
      assert(ans >= 0);
      printf("%lld\n", ans);
    }
  }
  return 0;
}
