#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

using Mint998 = ModInt<998244353>;
using Mint = ModInt<1000000007>;


int N, Q;
Mint A[3010][3010];
Mint B[3010][3010];

struct Rect {
  int x0, x1, y0, y1;
  int ox, oy;
  int rot;
  Mint lz;
  friend ostream &operator<<(ostream &os, const Rect &r) {
    return os << "Rect([" << r.x0 << "," << r.x1 << ")*[" << r.y0 << "," << r.y1 << "); " << r.ox << "," << r.oy << "; " << r.rot << "; " << r.lz << ")";
  }
  bool any() const {
    return (x0 < x1 && y0 < y1);
  }
};
vector<Rect> rs;

Rect tmp[5];
bool cut(const Rect &r, int x0, int y0, int x1, int y1) {
  if (x1 <= r.x0 || r.x1 <= x0) return false;
  if (y1 <= r.y0 || r.y1 <= y0) return false;
  chmax(x0, r.x0); chmin(x1, r.x1);
  chmax(y0, r.y0); chmin(y1, r.y1);
  fill(tmp, tmp + 5, r);
  tmp[0].x1 = x0;
  tmp[1].x0 = x1;
  tmp[2].x0 = x0; tmp[2].x1 = x1; tmp[2].y1 = y0;
  tmp[3].x0 = x0; tmp[3].x1 = x1; tmp[3].y0 = y1;
  tmp[4].x0 = x0; tmp[4].x1 = x1; tmp[4].y0 = y0; tmp[4].y1 = y1;
  if (r.rot == 0) {
    tmp[1].ox += (x1 - r.x0);
    tmp[2].ox += (x0 - r.x0);
    tmp[3].ox += (x0 - r.x0); tmp[3].oy += (y1 - r.y0);
    tmp[4].ox += (x0 - r.x0); tmp[4].oy += (y0 - r.y0);
  } else if (r.rot == 1) {
    tmp[0].oy += (r.x1 - x0);
    tmp[2].oy += (r.x1 - x1);
    tmp[3].oy += (r.x1 - x1); tmp[3].ox += (y1 - r.y0);
    tmp[4].oy += (r.x1 - x1); tmp[4].ox += (y0 - r.y0);
  } else if (r.rot == 2) {
    tmp[0].ox += (r.x1 - x0);
    tmp[2].ox += (r.x1 - x1); tmp[2].oy += (r.y1 - y0);
    tmp[3].ox += (r.x1 - x1); 
    tmp[4].ox += (r.x1 - x1); tmp[4].oy += (r.y1 - y1);
  } else if (r.rot == 3) {
    tmp[1].oy += (x1 - r.x0);
    tmp[2].oy += (x0 - r.x0); tmp[2].ox += (r.y1 - y0);
    tmp[3].oy += (x0 - r.x0);
    tmp[4].oy += (x0 - r.x0); tmp[4].ox += (r.y1 - y1);
  } else {
    assert(false);
  }
  return true;
}

void build() {
  rs = {Rect{0, N, 0, N, 0, 0, 0, Mint(0)}};
}
void dliub() {
  for (const Rect &r : rs) {
    const int m = r.x1 - r.x0;
    const int n = r.y1 - r.y0;
    for (int dx = 0; dx < m; ++dx) for (int dy = 0; dy < n; ++dy) {
      int cx, cy;
      if (r.rot == 0) {
        cx = dx;
        cy = dy;
      } else if (r.rot == 1) {
        cx = dy;
        cy = m - 1 - dx;
      } else if (r.rot == 2) {
        cx = m - 1 - dx;
        cy = n - 1 - dy;
      } else if (r.rot == 3) {
        cx = n - 1 - dy;
        cy = dx;
      } else {
        assert(false);
      }
      B[r.x0 + dx][r.y0 + dy] = A[r.ox + cx][r.oy + cy] + r.lz;
    }
  }
// cerr<<COLOR("96");for(int x=0;x<N;++x)pv(B[x],B[x]+N);cerr<<COLOR();
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) A[x][y] = B[x][y];
}

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    for (int x = 0; x < N; ++x) {
      Mint998 v = 1;
      for (int y = 0; y < N; ++y) {
        v *= (x + 2);
        A[x][y] = v.x;
      }
    }
    build();
    
    const int BLOCK = sqrt(N);
    for (int q = 0; q < Q; ++q) {
      int O, X0, X1, Y0, Y1;
      scanf("%d%d%d%d%d", &O, &X0, &Y0, &X1, &Y1);
      --X0;
      --Y0;
      if (O == 1) {
        const int D = X1 - X0;
        assert(D == Y1 - Y0);
// cerr<<COLOR("93")<<"["<<X0<<", "<<X1<<") * ["<<Y0<<", "<<Y1<<")"<<COLOR()<<endl;
        vector<Rect> rrs;
        for (const auto &r : rs) {
          if (cut(r, X0, Y0, X1, Y1)) {
            const int x0 = tmp[4].x0;
            const int x1 = tmp[4].x1;
            const int y0 = tmp[4].y0;
            const int y1 = tmp[4].y1;
            tmp[4].x0 = X0 + (D - (y1 - Y0));
            tmp[4].x1 = X0 + (D - (y0 - Y0));
            tmp[4].y0 = Y0 + (x0 - X0);
            tmp[4].y1 = Y0 + (x1 - X0);
            ++tmp[4].rot &= 3;
            for (int i = 0; i < 5; ++i) if (tmp[i].any()) {
              rrs.push_back(tmp[i]);
            }
          } else {
            rrs.push_back(r);
          }
        }
        rs.swap(rrs);
      } else if (O == 2) {
        Mint D;
        scanf("%u", &D.x);
// cerr<<COLOR("94")<<"["<<X0<<", "<<X1<<") * ["<<Y0<<", "<<Y1<<") "<<D<<COLOR()<<endl;
        vector<Rect> rrs;
        for (const auto &r : rs) {
          if (cut(r, X0, Y0, X1, Y1)) {
            tmp[4].lz += D;
            for (int i = 0; i < 5; ++i) if (tmp[i].any()) {
              rrs.push_back(tmp[i]);
            }
          } else {
            rrs.push_back(r);
          }
        }
        rs.swap(rrs);
      } else {
        assert(false);
      }
// cerr<<"rs = "<<rs<<endl;
      if ((q + 1) % BLOCK == 0) {
        dliub();
        build();
      }
    }
    dliub();
    
    Mint key = 0;
    for (int x = N; --x >= 0; ) for (int y = N; --y >= 0; ) {
      (key += A[x][y].x) *= 12345;
    }
    printf("%u\n", key.x);
  }
  return 0;
}