#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cstring>

#define debug(...) fprintf(stderr, __VA_ARGS__)

using LL = long long;
const int N = 3005, B = 35;
const int P1 = 998244353, P2 = 1000000007;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};

inline int read() {
  int x = 0, f = 1, c;
  while (!isdigit(c = getchar()))
    if (c == '-') f = -1;
  do x = x * 10 + c - '0';
  while (isdigit(c = getchar()));
  return x * f;
}

inline int gDir(int x1, int y1, int x2, int y2) {
  if (x1 == x2) return y1 > y2;
  return 2 + (x1 > x2);
}

int n, q, cnt;
int a[N][N], b[N][N];
int op[N], x1[N], y1[N], x2[N], y2[N], d[N];

int ax, ay, ad, bx, by, bd;
LL as, bs;
LL doit(int &x, int &y, int &s, int opt = 0) {
  LL st = 0;
  for (int i = cnt; i >= 1; --i) {
    if (x1[i] <= x && x <= x2[i] && y1[i] <= y && y <= y2[i]) {
      st |= 1ll << i;
      if (op[i] == 1) {
        int nx = x1[i] + y - y1[i], ny = y2[i] - (x - x1[i]);
        x = nx, y = ny;
      } else {
        (s += d[i]) %= P2;
      }
    }
    if (opt != 0 && (st >> i & 1) != (as >> i & 1)) return -1;
  }
  return st;
}
bool check(int X1, int Y1, int Y2) {
  int X2 = X1;
  for (int i = cnt; i >= 1; --i) {
    if (X1 > X2) std::swap(X1, X2);
    if (Y1 > Y2) std::swap(Y1, Y2);

    int op1x = x1[i] <= X1 && X1 <= x2[i]; 
    int op1y = y1[i] <= Y1 && Y1 <= y2[i];
    int op2x = x1[i] <= X2 && X2 <= x2[i]; 
    int op2y = y1[i] <= Y2 && Y2 <= y2[i];

    if ((op1x & op1y) != (op2x & op2y)) return 0; 
    if (X1 == X2 && op1x && Y1 < y1[i] && Y2 > y2[i]) return 0;
    if (Y1 == Y2 && op1y && X1 < x1[i] && X2 > x2[i]) return 0; 
    if (op1x && op1y) {
      if (op[i] == 1) {
        int nx = x1[i] + Y1 - y1[i], ny = y2[i] - (X1 - x1[i]);
        X1 = nx, Y1 = ny;
        nx = x1[i] + Y2 - y1[i], ny = y2[i] - (X2 - x1[i]);
        X2 = nx, Y2 = ny;
      }
    }
  }
  return 1;
}

void rebuild() {
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      int l = j, r = n;
      ax = i, ay = j, ad = 0, as = doit(ax, ay, ad);
      while (l < r) {
        int mid = (l + r + 1) / 2;
        if (check(i, j, mid)) l = mid;
        else r = mid - 1;
      }
      bx = i, by = r, bd = 0, bs = doit(bx, by, bd);
      int dir = gDir(ax, ay, bx, by);
      for (int k = j; k <= r; ++k) {
        b[i][k] = (a[ax][ay] + ad) % P2;
        ax += dx[dir], ay += dy[dir];
      }
      j = r;
    }
  }
  for (int i = 1; i <= n; ++i)
    memcpy(a[i], b[i], sizeof b[i]);
}

int main() {
  n = read(), q = read();
  for (int i = 1; i <= n; ++i) {
    int res = i + 1;
    for (int j = 1; j <= n; ++j) {
      a[i][j] = res;
      res = LL(res) * (i + 1) % P1;
    }
  }
  while (q--) {
    ++cnt;
    op[cnt] = read();
    x1[cnt] = read(), y1[cnt] = read(), x2[cnt] = read(), y2[cnt] = read();
    if (op[cnt] == 2) d[cnt] = read();
    if (cnt == B) rebuild(), cnt = 0;
  }
  if (cnt) rebuild();
  int bas = 12345, res = 1, ans = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      res = LL(res) * bas % P2;
      (ans += LL(a[i][j]) * res % P2) %= P2;
    }
  printf("%d\n", ans);
  return 0;
}