#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using u64=unsigned long long;
using lf=long double;
#define F(i,l,r) for(int i=l;i<=r;++i)
#define G(i,r,l) for(int i=r;i>=l;--i)
#define ct const
#define il inline
#define pb push_back
#define fi first
#define se second
template<class T>
il void tomn(T&x,T ct&y){y<x?x=y,0:0;}
template<class T>
il void tomx(T&x,T ct&y){y>x?x=y,0:0;}
#define DEBUG(x) cerr<<"line:"<<__LINE__<<" "#x"="<<x<<endl
#define CUT cerr<<"**********\n"
#define dbg(...) fprintf(stderr,__VA_ARGS__)
const lf EPS=1e-10L;
il int dcmp(lf x){return fabs(x)<=EPS?0:(x<0?-1:1);}
const ll INF=4e18L;

ct int N=3050;
ct ll Q=998244353,P=1000000007,B=12345;
int n,q;
ll a[N][N];
namespace S1{
	ll b[N][N];
	void wt(){
//		CUT;
//		F(i,1,n){
//			F(j,1,n)dbg("%d ",a[i][j]);
//			dbg("\n");
//		}
	}
	void main(){
//		F(i,1,n)F(j,1,n)a[i][j]=(i-1)*n+j;
		while(q--){
			int tp;scanf("%d",&tp);
			if(tp==1){
				int x,y,z,w;scanf("%d%d%d%d",&x,&y,&z,&w);
				int d=z-x;
				F(i,0,d)F(j,0,d)
					b[d-j][i]=a[x+i][y+j];
				F(i,0,d)F(j,0,d)
					a[x+i][y+j]=b[i][j];
			}else{
				int x1,y1,x2,y2;
				ll d;scanf("%d%d%d%d%lld",&x1,&y1,&x2,&y2,&d);
				F(i,x1,x2)F(j,y1,y2)
					(a[i][j]+=d)%=P;
			}
//			wt();
		}
		ll pw=1,ans=0;
		F(i,1,n)F(j,1,n)
			(pw*=B)%=P,(ans+=a[i][j]*pw)%=P;
		printf("%lld\n",ans);
	}
}
struct Upd{
	int tp,a[5];
}ud[N];
namespace S2{
	ll b[N][N];
	void main(){
//		F(i,1,n)F(j,1,n)a[i][j]=(i-1)*n+j;
		F(i,1,q){
			Upd x=ud[i];
			int x1=x.a[0],y1=x.a[1],x2=x.a[2],y2=x.a[3];
			ll d=x.a[4];
			(b[x1][y1]+=d)%=P;
			(b[x1][y2+1]+=P-d)%=P;
			(b[x2+1][y1]+=P-d)%=P;
			(b[x2+1][y2+1]+=d)%=P;
		}
		F(i,1,n)F(j,1,n)(b[i][j]+=b[i-1][j]+b[i][j-1]-b[i-1][j-1]+P)%=P;
//		F(i,1,n){
//			F(j,1,n)dbg("%lld ",b[i][j]);
//			dbg("\n");
//		}
		ll pw=1,ans=0;
		F(i,1,n)F(j,1,n)
			(pw*=B)%=P,(ans+=(a[i][j]+b[i][j]+P)*pw)%=P;
		printf("%lld\n",ans);
	}
}
int main(){
//#ifdef LOCAL
//	freopen("matrix.in","r",stdin);
//	freopen("matrix.out","w",stdout);
//#endif
	scanf("%d%d",&n,&q);
	F(i,1,n){
		a[i][1]=(i+1)%Q;
		F(j,2,n)a[i][j]=(a[i][j-1]*(i+1))%Q;
	}
	if(n<=100)
//	if(0)
		S1::main();
	else{
		bool flag[2]{};
		F(i,1,q){
			int tp;scanf("%d",&tp),flag[tp-1]=1;
			if(tp==1){
				int x,y,z,w;scanf("%d%d%d%d",&x,&y,&z,&w);
				ud[i]=Upd{tp,{x,y,z,w}};
			}else{
				int x1,y1,x2,y2,d;
				scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&d);
				ud[i]=Upd{tp,{x1,y1,x2,y2,d}};
			}
		}
		if(!flag[0])S2::main();
	}
}