#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/segtree>
ll op(ll a,ll b){
    return max(a,b);
}
ll ee(){
    return -1;
}


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    const int B = 500;
    int n,q;
    cin>>n>>q;
    vector<ll> a(n),b(n),c(n),d(n),e(n),f(n);
    for(int i = 0;i<n;i++) cin>>a[i]>>b[i]>>c[i]>>d[i]>>e[i]>>f[i];

    auto calc = [&](int i) {
        ll nx = c[i] - a[i];
        ll ny = d[i] - b[i];
        ll nnx = e[i] - a[i];
        ll nny = f[i] - b[i];
        return abs(nx*nny-ny*nnx);
    };

    vector<ll> t(q),l(q),r(q),na(q),nb(q),nc(q),nd(q),ne(q),nf(q);
    for(int i = 0;i<q;i++){
        cin>>t[i];
        if(t[i]==1) cin>>na[i]>>nb[i]>>nc[i]>>nd[i]>>ne[i]>>nf[i];
        else cin>>l[i]>>r[i];
    }

    vector<ll> ans(q,-1);
    int cnt = (q+B-1) / B;


    auto c1 = [&](vector<int> idx) {
        vector<ll> dx;
        for(int i = 0;i<n;i++){
            ll le = min(min(a[i],c[i]),e[i]);
            ll ri = max(max(a[i],c[i]),e[i]);
            dx.push_back(ri);
            dx.push_back(le);
        }
        for(auto&i:idx) dx.push_back(r[i]);
        for(auto&i:idx) dx.push_back(l[i]);
        sort(dx.begin(),dx.end());
        dx.erase(unique(dx.begin(),dx.end()),dx.end());
        int m = dx.size();
        atcoder::segtree<ll,op,ee> seg(m);
        vector<pair<pair<ll,ll>,pair<ll,ll>>> use;
        for(int i = 0;i<n;i++){
            ll le = min(min(a[i],c[i]),e[i]);
            ll ri = max(max(a[i],c[i]),e[i]);
            int ni = lower_bound(dx.begin(),dx.end(),ri) - dx.begin();
            ll now = calc(i);
            int nj = lower_bound(dx.begin(),dx.end(),le) - dx.begin();
            use.push_back({{ni,0},{nj,now}});
        }
        for(int i:idx){
            int ni = lower_bound(dx.begin(),dx.end(),r[i]) - dx.begin();
            int nj = lower_bound(dx.begin(),dx.end(),l[i]) - dx.begin();
            use.push_back({{ni,1},{i,nj}});
        }
        sort(use.begin(),use.end());
        for(auto&itr:use) {
            int t = itr.first.second;
            if(t==0){
                seg.set(itr.second.first,op(seg.get(itr.second.first),itr.second.second));
            }else{
                ans[itr.second.first] = max(ans[itr.second.first],seg.prod(itr.second.second,m));
            }
        }
    };

    for(int i = 0;i<cnt;i++){
        int le = i * B;
        int ri = (i+1) * B - 1;
        ri = min(ri,q-1);
        vector<int> idx;
        for(int j = le;j<=ri;j++) {
            if(t[j]==2) idx.push_back(j);
        }
        for(int j = le;j<=ri;j++) if(t[j]==2){
            for(int k = le;k<=j;k++) if(t[k]==1){
                if(!(l[j]<=min(min(na[k],nc[k]),ne[k])&&max(max(na[k],nc[k]),ne[k])<=r[j])) continue;
                ll nx = nc[k] - na[k];
                ll ny = nd[k] - nb[k];
                ll nnx = ne[k] - na[k];
                ll nny = nf[k] - nb[k];
                ans[j] = max(ans[j],abs(nx*nny-ny*nnx));
            }
        }
        c1(idx);
        for(int j = le;j<=ri;j++) if(t[j]==1){
            a.push_back(na[j]);;
            b.push_back(nb[j]);
            c.push_back(nc[j]);
            d.push_back(nd[j]);
            e.push_back(ne[j]);
            f.push_back(nf[j]);
            n++;
        }
    }

    for(int i = 0;i<q;i++) if(t[i]==2) cout<<ans[i]<<endl;
}