#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <typename...>
static inline int getchar_unlocked(void) {
  return getchar();
}
template <typename...>
static inline void putchar_unlocked(int c) {
  putchar(c);
}
void reader(int& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
  if (m) x = -x;
}
void reader(ll& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
  if (m) x = -x;
}
int reader(char c[]) {
  int i, s = 0;
  for (;;) {
    (i) = getchar_unlocked();
    if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
  }
  c[s++] = i;
  for (;;) {
    (i) = getchar_unlocked();
    if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
    c[s++] = i;
  }
  c[s] = '\0';
  return s;
}
int reader(string& c) {
  int i;
  for (;;) {
    (i) = getchar_unlocked();
    if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
  }
  c.push_back(i);
  for (;;) {
    (i) = getchar_unlocked();
    if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
    c.push_back(i);
  };
  return ((int)c.size());
}
template <class T, class S>
void reader(T& x, S& y) {
  reader(x);
  reader(y);
}
template <class T, class S, class U>
void reader(T& x, S& y, U& z) {
  reader(x);
  reader(y);
  reader(z);
}
template <class T, class S, class U, class V>
void reader(T& x, S& y, U& z, V& w) {
  reader(x);
  reader(y);
  reader(z);
  reader(w);
}
void writer(int x, char c) {
  int s = 0, m = 0;
  char f[10];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(ll x, char c) {
  int s = 0, m = 0;
  char f[20];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(const char c[]) {
  int i;
  for (i = 0; c[i] != '\0'; i++) putchar_unlocked(c[i]);
}
void writer(const string& x, char c) {
  int i;
  for (i = 0; x[i] != '\0'; i++) putchar_unlocked(x[i]);
  putchar_unlocked(c);
}
void writer(const char x[], char c) {
  int i;
  for (i = 0; x[i] != '\0'; i++) putchar_unlocked(x[i]);
  putchar_unlocked(c);
}
template <class T>
void writerLn(T x) {
  writer(x, '\n');
}
template <class T, class S>
void writerLn(T x, S y) {
  writer(x, ' ');
  writer(y, '\n');
}
template <class T, class S, class U>
void writerLn(T x, S y, U z) {
  writer(x, ' ');
  writer(y, ' ');
  writer(z, '\n');
}
template <class T, class S, class U, class V>
void writerLn(T x, S y, U z, V v) {
  writer(x, ' ');
  writer(y, ' ');
  writer(z, ' ');
  writer(v, '\n');
}
template <class T>
void writerArr(T x[], int n) {
  if (!n) {
    putchar_unlocked('\n');
    return;
  }
  for (int i = 0; i < (n - 1); i++) writer(x[i], ' ');
  writer(x[n - 1], '\n');
}
template <class T>
void writerArr(vector<T>& x) {
  writerArr(x.data(), (int)x.size());
}
void reader(ull& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = ull(k - '0');
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
}
void writer(ull x, char c) {
  int s = 0, m = 0;
  char f[20];
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
template <class T>
void chmin(T& a, const T& b) {
  if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
  if (a < b) a = b;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
ll mod_pow(ll a, ll n, ll mod) {
  ll ret = 1;
  ll p = a % mod;
  while (n) {
    if (n & 1) ret = ret * p % mod;
    p = p * p % mod;
    n >>= 1;
  }
  return ret;
}
template <class T>
T extgcd(T a, T b, T& x, T& y) {
  for (T u = y = 1, v = x = 0; a;) {
    T q = b / a;
    swap(x -= q * u, u);
    swap(y -= q * v, v);
    swap(b -= q * a, a);
  }
  return b;
}
ll mod_inv(ll a, ll m) {
  ll x, y;
  extgcd<ll>(a, m, x, y);
  return (m + x % m) % m;
}
const int MOD = 1000000007;
bool used[3010][3010];
bool blocked[3010][3010][4];
int main() {
  int n, m;
  reader(n, m);
  vector<int> x, y;
  x.push_back(0);
  y.push_back(0);
  vector<tuple<int, int, int>> abc, def;
  for (int i = 0; i < (n); i++) {
    int a, b, c;
    reader(a, b, c);
    x.push_back(a);
    x.push_back(b);
    y.push_back(c);
    abc.emplace_back(a, b, c);
  }
  for (int i = 0; i < (m); i++) {
    int d, e, f;
    reader(d, e, f);
    x.push_back(d);
    y.push_back(e);
    y.push_back(f);
    def.emplace_back(d, e, f);
  }
  auto xConv = [&x](int v) {
    return lower_bound(x.begin(), x.end(), v) - x.begin();
  };
  auto yConv = [&y](int v) {
    return lower_bound(y.begin(), y.end(), v) - y.begin();
  };
  {
    sort(x.begin(), x.end());
    x.erase(unique(x.begin(), x.end()), x.end());
    sort(y.begin(), y.end());
    y.erase(unique(y.begin(), y.end()), y.end());
    for (int i = 0; i < (n); i++) {
      int a, b, c;
      tie(a, b, c) = abc[i];
      tie(a, b, c) = make_tuple(xConv(a), xConv(b), yConv(c));
      for (int p = a + 1; p <= b; p++) {
        blocked[p][c][3] = true;
        blocked[p][c + 1][1] = true;
      }
    }
    for (int i = 0; i < (m); i++) {
      int a, b, c;
      tie(a, b, c) = def[i];
      tie(a, b, c) = make_tuple(xConv(a), yConv(b), yConv(c));
      for (int p = b + 1; p <= c; p++) {
        blocked[a][p][0] = true;
        blocked[a + 1][p][2] = true;
      }
    }
  }
  int sx = xConv(0);
  int sy = yConv(0);
  queue<Pii> q;
  for (int i = 0; i < (2); i++)
    for (int j = 0; j < (2); j++)
      q.emplace(sx + i, sy + j), used[sx + i][sy + j] = true;
  while (!q.empty()) {
    int a, b;
    tie(a, b) = q.front();
    q.pop();
    int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
    for (int k = 0; k < (4); k++) {
      int na = a + dx[k], nb = b + dy[k];
      if (na < 0 || na >= ((int)x.size()) || nb < 0 || nb >= ((int)y.size()))
        continue;
      if (blocked[a][b][k]) continue;
      if (used[na][nb]) continue;
      used[na][nb] = true;
      q.emplace(na, nb);
    }
  }
  ll ans = 0;
  bool inf = false;
  for (int i = 0; i < (((int)x.size()) + 1); i++) {
    if (inf) break;
    for (int j = 0; j < (((int)y.size()) + 1); j++) {
      if (!used[i][j]) continue;
      if (i == 0 || i == ((int)x.size()) || j == 0 || j == ((int)y.size())) {
        inf = true;
        break;
      }
      ll dx = x[i] - x[i - 1];
      ll dy = y[j] - y[j - 1];
      ans += dx * dy;
    }
  }
  if (inf) {
    puts("INF");
  } else {
    writerLn(ans);
  }
  return 0;
}
