#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
// const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N, Q;
  cin >> N >> Q;
  auto T = make_v< int64 >(N, 6);
  cin >> T;
  auto get_area = [&](vector< int64 > &xs) {
    int64 x1 = xs[0];
    int64 y1 = xs[1];
    int64 x2 = xs[2];
    int64 y2 = xs[3];
    int64 x3 = xs[4];
    int64 y3 = xs[5];
    return abs((x1 - x3) * (y2 - y3) - (x2 - x3) * (y1 - y3));
  };
  for(auto &v : T) v.emplace_back(get_area(v));

  vector< vector< int64 > > qs;
  int B = 333;

  for(int i = 0; i < Q; i++) {
    int t;
    cin >> t;
    if(t == 1) {
      vector< int64 > X(6);
      cin >> X;
      X.emplace_back(get_area(X));
      qs.emplace_back(X);
    } else {
      vector< int64 > X(2);
      cin >> X;
      qs.emplace_back(X);
      ++X[1];
    }
    if(qs.size() >= B or i + 1 == Q) {
      vector< int > xs;
      for(auto &vs : qs) {
        if(vs.size() == 2) {
          xs.emplace_back(vs[0]);
          xs.emplace_back(vs[1]);
        }
      }
      sort(begin(xs), end(xs));
      xs.erase(unique(begin(xs), end(xs)), end(xs));
      auto cost = make_v< int64 >(xs.size(), xs.size());
      fill_v(cost, -1);
      for(auto v : T) {
        auto[l, r]=minmax({v[0], v[2], v[4]});
        l = lower_bound(begin(xs), end(xs), l) - begin(xs);
        r = lower_bound(begin(xs), end(xs), r) - begin(xs);
        chmax(cost[l][r], v[6]);
      }
      for(int d = 0; d < xs.size(); d++) {
        for(int l = 0; l + d < xs.size(); l++) {
          if(l) chmax(cost[l - 1][l + d], cost[l][l + d]);
          if(l + d + 1 < xs.size()) chmax(cost[l][l + d + 1], cost[l][l + d]);
        }
      }
      vector< int64 > ans;
      int ps = (int) T.size();
      for(auto &vs : qs) {
        if(vs.size() == 2) {
          int l = lower_bound(begin(xs), end(xs), vs[0]) - begin(xs);
          int r = lower_bound(begin(xs), end(xs), vs[1]) - begin(xs);
          int64 ret = cost[l][r];
          for(int j = ps; j < T.size(); j++) {
            auto &v = T[j];
            auto[l, r]=minmax({v[0], v[2], v[4]});
            if(vs[0] <= l and r <= vs[1]) chmax(ret, v[6]);
          }
          cout << ret << "\n";
        } else {
          T.emplace_back(vs);
        }
      }
      qs.clear();
    }
  }
}