#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001


template <class S, S (*op)(S, S), S (*e)()> struct compressed_segtree {
	
	segtree<S,op,e> seg;
	
	compressed_segtree() : compressed_segtree(vector<long long>(0)) {
	}
	compressed_segtree(vector<long long> tx, vector<S> v){
		_tx = tx;
		seg = segtree<S,op,e>(v);
	}
	compressed_segtree(vector<long long> tx){
		_tx = tx;
		seg = segtree<S,op,e>(tx.size());
	}
	
	int lower_ind(long long p){
		return distance(_tx.begin(),lower_bound(_tx.begin(),_tx.end(),p));
	}
	
	void set(long long p, S x) {
		seg.set(lower_ind(p), x);
    }
	
	S get(long long p) {
		int idx = lower_ind(p);
		if(idx!=_tx.size()&&_tx[idx]==p)return seg.get(idx);
		return e();
    }
	
	S prod(long long l,long long r) {
       return seg.prod(lower_ind(l),lower_ind(r));
    }

	S all_prod() { return seg.all_prod(); }
	
	vector<long long> _tx;
	
};

template <class S, S (*op)(S, S), S (*e)()> struct compressed_2d_segtree {
	
	vector<compressed_segtree<S,op,e>> seg;
	
	compressed_2d_segtree() : compressed_2d_segtree(vector<long long>(0)) {
	}
	/*
	compressed_2d_segtree(vector<long long> tx, vector<S> v){
		_tx = tx;
		seg = segtree<S,op,e>(v);
	}
	*/
	compressed_2d_segtree(vector<pair<long long,long long>> tp){
		_tp = tp;
		rep(i,tp.size()){
			_tx.push_back(tp[i].first);
			_ty.push_back(tp[i].second);
		}
		sort(_tx.begin(),_tx.end());
		_tx.erase(unique(_tx.begin(),_tx.end()),_tx.end());
		sort(_ty.begin(),_ty.end());
		_ty.erase(unique(_ty.begin(),_ty.end()),_ty.end());
		int n = _tx.size();
		log = 0;
		while((1LL<<log) < n){
			log++;
		}
		
		size = 1<<log;
		
		seg.resize(size*2);
		
		vector<vector<long long>> ys(size*2);
		rep(i,tp.size()){
			ys[size + lower_indx(tp[i].first)].push_back(tp[i].second);
		}
		for(int i=size;i<size*2;i++){
			sort(ys[i].begin(),ys[i].end());
			ys[i].erase(unique(ys[i].begin(),ys[i].end()),ys[i].end());
			seg[i] = compressed_segtree<S,op,e>(ys[i]);
		}
		
		for(int i=size-1;i>=1;i--){
			vector<long long> a(ys[i*2].rbegin(),ys[i*2].rend()), b(ys[i*2+1].rbegin(),ys[i*2+1].rend());
			while(a.size()>0||b.size()>0){
				if(a.size()==0){
					swap(a,b);
				}
				else if(b.size()>0){
					if(a.back()>b.back())swap(a,b);
				}
				if(ys[i].size()==0||ys[i].back()!=a.back())ys[i].push_back(a.back());
				a.pop_back();
			}
			
			seg[i] = compressed_segtree<S,op,e>(ys[i]);
			ys[i*2].clear();
			ys[i*2+1].clear();
		}

	}
	
	int lower_indx(long long p){
		return distance(_tx.begin(),lower_bound(_tx.begin(),_tx.end(),p));
	}
	
	int lower_indy(long long p){
		return distance(_ty.begin(),lower_bound(_ty.begin(),_ty.end(),p));
	}
	
	void set(long long px, long long py, S x) {
		px = lower_indx(px) + size;
        seg[px].set(py,x);
        for (int i = 1; i <= log; i++) update(px >> i, py);
    }
	
	S get(long long px, long long py) {
		int idx = lower_indx(px);
		if(idx!=_tx.size()&&_tx[idx]==px)return seg[idx+size].get(py);
		return e();
    }
	
	S prod(long long lx,long long rx, long long ly, long long ry) {
		S sml = e(), smr = e();
        lx = lower_indx(lx)+size;
        rx = lower_indx(rx)+size;

        while (lx < rx) {
            if (lx & 1) sml = op(sml, seg[lx++].prod(ly,ry));
            if (rx & 1) smr = op(seg[--rx].prod(ly,ry), smr);
            lx >>= 1;
            rx >>= 1;
        }
        return op(sml, smr);
    }

	S all_prod() { return seg[1].all_prod(); }
	int size, log;
	vector<pair<long long,long long>> _tp;
	vector<long long> _tx,_ty;
	
	void update(int k, long long py) {
		seg[k].set(py, op(seg[2*k].get(py), seg[2*k+1].get(py)));
	}
};


long long op(long long a,long long b){
	return max(a,b);
}

long long ee(){
	return 0LL;
}

long long get(long long a,long long b,long long c,long long d,long long e,long long f){
	c -= a;
	d -= b;
	e -= a;
	f -= b;
	return abs(c*f-d*e);
}

int main(){
	
	int n,q;
	scanf("%d %d",&n,&q);
	
	vector<pair<long long,long long>> p;
	vector<int> a(n),b(n),c(n),d(n),e(n),f(n);
	rep(i,n){
		scanf("%d %d %d %d %d %d",&a[i],&b[i],&c[i],&d[i],&e[i],&f[i]);
		p.emplace_back(min({a[i],c[i],e[i]}),max({a[i],c[i],e[i]}));
	}
	

	
	vector<array<int,6>> qs(q);
	vector<int> t(q);
	
	rep(i,q){		
		scanf("%d",&t[i]);
		int cc;
		if(t[i]==1)cc = 6;
		else cc = 2;
		
		rep(j,cc){
			scanf("%d",&qs[i][j]);
		}
		if(t[i]==1){
			p.emplace_back(min({qs[i][0],qs[i][2],qs[i][4]}),max({qs[i][0],qs[i][2],qs[i][4]}));
		}
	}
	
	sort(p.begin(),p.end());
	p.erase(unique(p.begin(),p.end()),p.end());
	
	compressed_2d_segtree<long long,op,ee> seg(p);
	
	rep(i,n){
		seg.set(min({a[i],c[i],e[i]}),max({a[i],c[i],e[i]}),
		op(seg.get(min({a[i],c[i],e[i]}),max({a[i],c[i],e[i]})), get(a[i],b[i],c[i],d[i],e[i],f[i])));
	}
	
	rep(i,q){
		if(t[i]==1){
			seg.set(min({qs[i][0],qs[i][2],qs[i][4]}),max({qs[i][0],qs[i][2],qs[i][4]}),
		op(seg.get(min({qs[i][0],qs[i][2],qs[i][4]}),max({qs[i][0],qs[i][2],qs[i][4]})),
		get(qs[i][0],qs[i][1],qs[i][2],qs[i][3],qs[i][4],qs[i][5])));
		}
		else{
			long long ans = seg.prod(qs[i][0],qs[i][1]+1,qs[i][0],qs[i][1]+1);
			if(ans==0)ans = -1;
			printf("%lld\n",ans);
		}
	}
	
	return 0;
}