/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 3009, M = N * N, mod = 1e9 + 7;
inline void add(int &x, int y) {x = (x + y) % mod;}
inline void del(int &x, int y) {x = (x - y + mod) % mod;}
inline int Pow(int x, int y, int mo)
{
	int res = 1, base = x;
	while(y)
	{
		if(y & 1) res = 1ll * res * base % mo;
		base = 1ll * base * base % mo; y >>= 1;
	} return res;
}
int det[4][2] = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};
int n, Q;
struct node
{
	int x[4], v[4];
}b[M];
int a[N][N], p[N][N], val[M];
inline int id(int x, int y) {return (x - 1) * n + y;}
inline void get(int w1, int w2, int w3, int x, int y)
{
	L(i, 0, 3)
		L(j, 0, 3)
			if(b[w1].x[i] == b[w2].x[j] && b[w1].x[i] != w3 && b[w1].x[i])
			{
		//		cout << w1 << " " << w2 << " " << w3 << " " << b[w1].x[i] << "awa" << endl;
				p[x][y] = b[w1].x[i];
				val[p[x][y]] = (val[w1] - b[w1].v[i] + mod) % mod; return ;
			}
	puts("-1"); return ;
}
inline void get1(int x, int l, int y)
{
	if(l == 1)
	{
		int nw = id(x, 1);
		a[x][1] = 0, p[x][1] = nw;
		a[x][2] = (mod - b[nw].v[1]) % mod; nw = b[nw].x[1];
		p[x][2] = nw;
		val[p[x][2]] = a[x][2]; val[p[x][1]] = 0; l++;
	}
	y = min(n - 1, y);
	L(i, l, y)
	{
		int tt = 0;
		L(j, 1, 3)
			if(b[p[x][i]].x[j] == p[x][i - 1]) {tt = j; break;}
		tt ^= 1;
		p[x][i + 1] = b[p[x][i]].x[tt]; val[p[x][i + 1]] = (val[p[x][i]] - b[p[x][i]].v[tt] + mod);
		(val[p[x][i + 1]] >= mod) ? val[p[x][i + 1]] -= mod : 0;
	}
 	return ;
}
inline void get2(int x, int l, int y)
{
	if(l == 1)
	{
		int nw = id(1, x);
		a[1][x] = 0, p[1][x] = nw;
		a[2][x] = (mod - b[nw].v[3]) % mod; nw = b[nw].x[3]; p[2][x] = nw;
		val[p[2][x]] = a[2][x]; val[p[1][x]] = 0; l++;
	}
	y = min(n - 1, y);
	L(i, l, y)
	{
		int tt = 0;
		L(j, 1, 3)
			if(b[p[i][x]].x[j] == p[i - 1][x]) {tt = j; break;}
		tt ^= 1;
		p[i + 1][x] = b[p[i][x]].x[tt];
		val[p[i + 1][x]] = (val[p[i][x]] - b[p[i][x]].v[tt] + mod);
		(val[p[i + 1][x]] >= mod) ? val[p[i + 1][x]] -= mod : 0;
	}
	return ;
}
inline void get3(int x, int y)
{
	int nw = id(x, 1);
	a[x][1] = 0, p[x][1] = nw;
	a[x][2] = (mod - b[nw].v[1]) % mod; nw = b[nw].x[1];  p[x][2] = nw;
	y = min(n - 1, y);
	L(i, 2, y)
	{
		int tt = 0;
		L(j, 1, 3)
			if(b[p[x][i]].x[j] == p[x][i - 1]) {tt = j; break;}
		tt ^= 1;
		p[x][i + 1] = b[p[x][i]].x[tt]; a[x][i + 1] = (a[x][i] - b[p[x][i]].v[tt]);
		if(a[x][i + 1] < 0) a[x][i + 1] += mod;
		else if(a[x][i + 1] >= mod) a[x][i + 1] -= mod;
	}
	L(i, 1, y + 1) val[p[x][i]] = a[x][i];
 	return ;
}
inline void upd(int x, int w1, int w2)
{
	int ff = 3;
	if(b[x].x[0] == w1) ff = 0;
	else if(b[x].x[1] == w1) ff = 1;
	else if(b[x].x[2] == w1) ff = 2;
	b[x].x[ff] = w2;
	b[x].v[ff] = (val[x] - val[w2] + mod);
	if(b[x].v[ff] >= mod) b[x].v[ff] -= mod;  return ;
}
inline void mdf(int x, int w1, int d)
{
	L(i, 0, 3)
		if(b[x].x[i] == w1) {add(b[x].v[i], d); return ;} return ;
}
inline void update(int ax, int ay, int bx, int by)
{
	if(ax == bx) return ;
	L(i, ay, by)
	{
		upd(p[ax][i], p[ax - 1][i], p[bx - (i - ay)][ay - 1]), upd(p[bx][i], p[bx + 1][i], p[bx - (i - ay)][by + 1]),
		upd(p[ax - 1][i], p[ax][i], p[ax + (i - ay)][by]), upd(p[bx + 1][i], p[bx][i], p[ax + (i - ay)][ay]);
	}
	L(i, ax, bx)
	{
		upd(p[i][ay], p[i][ay - 1], p[bx + 1][ay + (i - ax)]), upd(p[i][by], p[i][by + 1], p[ax - 1][ay + (i - ax)]),
		upd(p[i][ay - 1], p[i][ay], p[ax][ay + (bx - i)]), upd(p[i][by + 1], p[i][by], p[bx][ay + (bx - i)]);
	}
	return ;
}
inline void modify(int ax, int ay, int bx, int by, int d)
{
	int tt = (mod - d) % mod;
	L(i, ay, by) mdf(p[ax][i], p[ax - 1][i], d), mdf(p[ax - 1][i], p[ax][i], tt);
	L(i, ay, by) mdf(p[bx][i], p[bx + 1][i], d), mdf(p[bx + 1][i], p[bx][i], tt);
	L(i, ax, bx) mdf(p[i][ay], p[i][ay - 1], d), mdf(p[i][ay - 1], p[i][ay], tt);
	L(i, ax, bx) mdf(p[i][by], p[i][by + 1], d), mdf(p[i][by + 1], p[i][by], tt);
	return ;
}
int tn;
int pown[M];
signed main()
{
//	freopen("5.in", "r", stdin);
	n = read(), Q = read(); tn = n;
	L(i, 2, n + 1)
	{
		a[i][2] = i;
		L(j, 3, n + 1) a[i][j] = 1ll * a[i][j - 1] * i % 998244353;
	}
	n += 2;
	L(i, 1, n)
		L(j, 1, n)
		{
			val[id(i, j)] = a[i][j];
			int wx = id(i, j);
			L(k, 0, 3)
			{
				int ax = i + det[k][0], ay = j + det[k][1];
				if(ax <= 0 || ax > n || ay <= 0 || ay > n) continue;
				int wy = id(ax, ay);
				b[wx].x[k] = wy;
				b[wx].v[k] = (a[i][j] - a[ax][ay] + mod) % mod;
 			}
		}
	L(i, 1, Q)
	{
		int op = read(), ax = read() + 1, ay = read() + 1, bx = read() + 1, by = read() + 1;
		get1(ax - 1, 1, by + 1); get1(bx + 1, 1, by + 1);
		get2(ay - 1, 1, bx + 1); get2(by + 1, 1, bx + 1);
		get(p[ax - 1][ay], p[ax][ay - 1], p[ax - 1][ay - 1], ax, ay);
		get(p[ax - 1][by], p[ax][by + 1], p[ax - 1][by + 1], ax, by);
		get(p[bx + 1][ay], p[bx][ay - 1], p[bx + 1][ay - 1], bx, ay);
		get(p[bx + 1][by], p[bx][by + 1], p[bx + 1][by + 1], bx, by);
		get1(ax, ay, by); get1(bx, ay, by); get2(ay, ax, bx); get2(by, ax, bx);
		if(op == 1) update(ax, ay, bx, by);
		else
		{
			int d = read(); modify(ax, ay, bx, by, d);
		}
	}
	L(i, 1, n) get3(i, n);
	n -= 2; pown[0] = 1;
	L(i, 1, n * n) pown[i] = 1ll * pown[i - 1] * 12345 % mod;
	int ans = 0;
	L(i, 1, n)
		L(j, 1, n) ans = (ans + 1ll * a[i + 1][j + 1] % mod * pown[(i - 1) * n + j] % mod) % mod;
	cout << ans << endl;
	return 0;
}