#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  namespace tuple_util{
    template<class F, class R, class ... Args, size_t... I> void apply(F& f, R& res, tuple<Args...>& t, index_sequence<I...>){ res = f( get<I>(t)... ); }
    template<class F, class R, class ... Args> void apply(F& f, R& res, tuple<Args...>& t){ apply(f,res,t, index_sequence_for<Args...>{} ); }
    template<class T, size_t ... I> void input (istream& is, T& t, index_sequence<I...>){ using s=int[]; (void)s{(void(is>>get<I>(t)),0)...} ; }
    template<class T, size_t ... I> void output(ostream& os, T& t, index_sequence<I...>){ using s=int[]; (void)s{(void(os<<get<I>(t)<<" "),0)...} ; }
  }
  template<class... Args> istream& operator >> (istream& is, tuple<Args...>& t){ tuple_util::input (is, t, index_sequence_for<Args...>{}); return is;}
  template<class... Args> ostream& operator << (ostream& os, const tuple<Args...>& t){ tuple_util::output(os, t, index_sequence_for<Args...>{}); return os;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

template<class T>
vector<T> compress(vector<T> a, vector<T>& b){
  b = a;
  sort(b.begin(), b.end());
  b.erase( unique(b.begin(), b.end()), b.end());
  for(int i=0; i<a.size(); i++){
    a[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
  }
  return a;
}

int main(){
  int n,m;
  cin >> n,m;

  vector<tuple<long long, long long, long long>> a(n), d(m);
  cin >> a, d;

  vector<long long> x, y;
  for(int i=0; i<n; i++){
    x.push_back(get<0>(a[i])*2);
    x.push_back(get<0>(a[i])*2 + 1);

    x.push_back(get<1>(a[i])*2);
    x.push_back(get<1>(a[i])*2 + 1);

    y.push_back(get<2>(a[i])*2);
    y.push_back(get<2>(a[i])*2 + 1);
  }
  for(int i=0; i<m; i++){
    x.push_back(get<0>(d[i])*2);
    x.push_back(get<0>(d[i])*2 + 1);

    y.push_back(get<1>(d[i])*2);
    y.push_back(get<1>(d[i])*2 + 1);

    y.push_back(get<2>(d[i])*2);
    y.push_back(get<2>(d[i])*2 + 1);

  }

  x.push_back(0);
  y.push_back(0);
  x.push_back(1);
  y.push_back(1);

  x.push_back(-2000000000000000011ll);
  x.push_back(-2000000000000000010ll);
  x.push_back(+2000000000000000010ll);
  x.push_back(+2000000000000000011ll);

  y.push_back(-2000000000000000011ll);
  y.push_back(-2000000000000000010ll);
  y.push_back(+2000000000000000010ll);
  y.push_back(+2000000000000000011ll);

  vector<long long> x_dict, y_dict;
  auto x_ = compress(x, x_dict);
  auto y_ = compress(y, y_dict);

  auto get_line_a = [&](int i){
    return make_tuple(x_[i*4 + 0], x_[i*4 + 2], y_[i*2]);
  };

  auto get_line_b = [&](int i){
    return make_tuple(x_[4*n + i*2], y_[2*n + i*4], y_[n*2 + i*4 + 2]);
  };

  int h = y_dict.size();
  int w = x_dict.size();

  vector<vector<int>> visit(h, vector<int>(w, 0));
  for(int i=0; i<n; i++){
    auto l = get_line_a(i);
    long long x0, x1, y0;
    tie(x0, x1, y0) = l;
    visit[y0][x0]   += 1;
    visit[y0+1][x0] -= 1;
    visit[y0][x1]   -= 1;
    visit[y0+1][x1] += 1;
  }
  for(int i=0; i<m; i++){
    auto l = get_line_b(i);
    long long x0, y0, y1;
    tie(x0, y0, y1) = l;
    visit[y0][x0]   += 1;
    visit[y0][x0+1] -= 1;
    visit[y1][x0]   -= 1;
    visit[y1][x0+1] += 1;
  }

  for(int i=0; i<h; i+=2){
    for(int j=0; j<w; j+=2){
      visit[i][j] += 1;
      if(i+1<h) visit[i+1][j] -= 1;
      if(j+1<w) visit[i][j+1] -= 1;
      if(i+1<h && j+1<w) visit[i+1][j+1] += 1;
    }
  }

  for(int i=0; i<h; i++){
    for(int j=0; j<w; j++){
      if(i) visit[i][j] += visit[i-1][j];
      if(j) visit[i][j] += visit[i][j-1];
      if(i&&j) visit[i][j] -= visit[i-1][j-1];
    }
  }

  // for(int i=0; i<h; i++){
  //   eprintln(visit[i]);
  // }

  long long ushi_x = lower_bound(begin(x_dict), end(x_dict), 1) - begin(x_dict);
  long long ushi_y = lower_bound(begin(y_dict), end(y_dict), 1) - begin(y_dict);

  queue<pair<int,int>> q;
  int dx[] = {0, 0, 1,-1, 1, 1,-1,-1};
  int dy[] = {1,-1, 0, 0, 1,-1, 1,-1};

  q.push({ushi_y, ushi_x});
  visit[ushi_y][ushi_x] = -1;
  while(q.size()){
    auto p = q.front();
    q.pop();
    long long r, c;
    tie(r,c) = p;
    
    for(int k=0; k<4; k++){
      long long rr = r + dy[k];
      long long cc = c + dx[k];

      if(rr <= 1 || rr >= h-2 || cc <= 1 || cc >= w-2){
        puts("INF");
        return 0;
      }
      if(visit[rr][cc] != 0) continue;
      visit[rr][cc] = -1;
      q.push({rr, cc});
    }
  }


  // for(int i=0; i<h; i++){
  //   eprintln(join(visit[i], "\t"));
  // }

  long long ans = 0;
  for(int i=1; i+2<h; i+=2){
    long long dy = (y_dict[i+2] - y_dict[i]) / 2;
    for(int j=1; j+2<w; j+=2){
      if(visit[i][j] != -1) continue;
      long long dx = (x_dict[j+2] - x_dict[j]) / 2;

      ans += dy * dx;
    }
  }

  println(ans);

  return 0;
}


Measured memory_bytes: 144712