#include <bits/stdc++.h>
#define ll long long
using namespace std;

template<typename ...Args>
signed debug(const char*str,Args ...args){return fprintf(stderr,str,args...);}

inline static int read(){
    int sum=0,neg=false,ch=getchar();
    while(!isdigit(ch)) neg|=(ch=='-'),ch=getchar();
    while(isdigit(ch)) sum=(sum<<3)+(sum<<1)+(ch^48),ch=getchar();
    return neg?-sum:sum;
}

enum direct{R,D,L,U};
constexpr int mod=1e9+7,dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
void Pmod(int&x){if(x>=mod) x-=mod;}
void Nmod(int&x){if(x<0) x+=mod;}
int _Pmod(int x){return x>=mod?x-mod:x;}
int _Nmod(int x){return x<0?x+mod:x;}

int n,q,a[3005][3005],id[3005][3005];

struct{int v[4],val[4],rot[4];}node[9012005];
struct pointer{
    int p,offset,sum;
    pointer() = default;
    pointer(int p):p(p),offset(0),sum(0){}
    operator int(){return p;}
    int dir(int d){return offset+d&3;}
    int&v(int d){return node[p].v[dir(d)];}
    int&val(int d){return node[p].val[dir(d)];}
    int&rot(int d){return node[p].rot[dir(d)];}
    void move(int d){
        int t=dir(d); Pmod(sum+=node[p].val[t]);
        offset+=node[p].rot[t],p=node[p].v[t];
    }
};

#define F(A,B,C,D,E,F,Expr) for(;Expr;ptr.move(A),E) Nmod(ptr.val(B)-=val),ptr.move(B),Pmod(ptr.val(C)+=val),ptr.move(C); ptr.move(D),F;
#define G(A,B,C,D,E,Expr) for(;Expr;ptr.move(A),D) I[B].push_back(ptr),O[B].push_back(move(B,ptr)); ptr.move(C),E
pointer move(int d,pointer x){return x.move(d),x;}
void update(int x1,int y1,int x2,int y2,int val){
    pointer ptr=x1; int x=x1,y=0; while(y<y1) ptr.move(R),y++;
    F(R,U,D,L,y++,y--,y<=y2);F(D,R,L,U,x++,x--,x<=x2);F(L,D,U,R,y--,y++,y1<=y);F(U,L,R,D,x--,x++,x1<=x);
}

void rotate(int x1,int y1,int x2,int y2){
    pointer ptr=x1; int x=x1,y=0,d=x2-x1+1; while(y<y1) ptr.move(R),y++; vector<pointer> I[4],O[4];
    G(R,U,L,y++,y--,y<=y2);G(D,R,U,x++,x--,x<=x2);G(L,D,R,y--,y++,y1<=y);G(U,L,D,x--,x++,x1<=x);
    
    for(int k=0;k<4;k++){
        for(int i=0;i<d;i++){
            I[k][i].rot(k)=-(O[k-1&3][i].rot(k+1&3)=I[k][i].offset-O[k-1&3][i].offset+1&3)&3;
            I[k][i].v(k)=O[k-1&3][i],O[k][i].v(k+2&3)=I[k+1&3][i];
            I[k][i].val(k)=mod-(O[k-1&3][i].val(k+1&3)=_Nmod(I[k][i].sum-O[k-1&3][i].sum));
        }
    }
}

signed main(){
    // freopen("matrix.in","r",stdin);
    // freopen("matrix.out","w",stdout);
    n=read(),q=read(); int cnt=n,ans=0;
    for(int i=1;i<=n;i++) id[i][0]=i;
    for(int i=1;i<=n;i++) id[0][i]=++cnt;
    for(int i=1;i<=n;i++) id[i][n+1]=++cnt;
    for(int i=1;i<=n;i++) id[n+1][i]=++cnt;
    
    for(int i=1;i<=n;i++) for(int j=1,x=i+1;j<=n;j++,x=x*(i+1ll)%998244353) a[i][j]=x,id[i][j]=++cnt;
	for(int i=0;i<=n+1;i++){
        for(int j=0,p=i;j<=n+1;p=id[i][++j]){
            for(int k=0,tx,ty;k<4;k++){
                tx=i+dir[k][0],ty=j+dir[k][1];
                if(tx<0 || n+1<tx || ty<0 || n+1<ty) continue;
                node[p].v[k]=id[tx][ty],node[p].val[k]=_Nmod(a[tx][ty]-a[i][j]);
            }
        }
    }
    
    while(q--){
        int opt=read(),x1=read(),y1=read(),x2=read(),y2=read();
        if(opt==1) rotate(x1,y1,x2,y2); else update(x1,y1,x2,y2,read());
    }
    
    pointer ptr=1;
    for(int i=1,sum=0,mul=12345;i<=n;i++,sum=0,ptr=i){
        for(int j=1;j<=n;j++,ptr.move(R),mul=mul*12345ll%mod){
            Pmod(sum+=ptr.val(R)),ans=(ans+(ll)mul*sum)%mod;
        }
    }
    return printf("%d\n",ans),0;
}