#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; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


// root: min (tie-break: left)
struct MinCartesianTree {
  int n, rt;
  vector<int> par, lef, rig;
  template <class T> void build(int n_, T *as) {
    assert(n_ >= 1);
    n = n_;
    rt = 0;
    par.assign(n, -1);
    lef.assign(n, -1);
    rig.assign(n, -1);
    int top = 0;
    vector<int> stack(n, 0);
    for (int u = 1; u < n; ++u) {
      if (as[stack[top]] > as[u]) {  // >
        for (; top >= 1 && as[stack[top - 1]] > as[u]; --top) {}  // >
        if (top == 0) {
          rt = par[lef[u] = stack[top]] = u;
        } else {
          par[lef[u] = stack[top]] = u;
          rig[par[u] = stack[top - 1]] = u;
        }
        stack[top] = u;
      } else {
        rig[par[u] = stack[top]] = u;
        stack[++top] = u;
      }
    }
  }
  template <class T> void build(const T &as) {
    build(as.size(), as.data());
  }
};


int N, Q;
vector<int> O, L, R, X;


namespace brute {
vector<int> qs;
MinCartesianTree ct;
Mint dfs(int l, int r, int u) {
  Mint ret = 0;
  if (l < u && u < r && qs[u] < Q) {
    ret += dfs(l, u, ct.lef[u]);
    ret += dfs(u, r, ct.rig[u]);
    ret /= 2;
  } else {
    ret = (r - l);
  }
// cerr<<"dfs "<<l<<" "<<r<<" "<<u<<": "<<ret<<endl;
  return ret;
}
Mint run() {
cerr<<"[brute::run]"<<endl;
  Mint ans = 0;
  for (int q = 0; q < Q; ++q) if (O[q] == 1) {
    qs.assign(N + 2, Q);
    for (int qq = q + 1; qq < Q; ++qq) if (O[qq] == 2) {
      if (L[q] < X[qq] && X[qq] < R[q]) {
        chmin(qs[X[qq]], qq);
      }
    }
// cerr<<L[q]<<" "<<R[q]<<" "<<qs<<endl;
    ct.build(qs);
    ans += dfs(L[q], R[q], ct.rt);
  }
  return ans;
}
}  // brute


namespace sub3 {
Mint run() {
cerr<<"[sub3::run]"<<endl;
  const Mint INV2 = Mint(2).inv();
  vector<Mint> invTwo(N + 1, 1);
  invTwo[0] = 1;
  for (int i = 1; i <= N; ++i) invTwo[i] = invTwo[i - 1] * INV2;
  
  vector<int> qs(N + 2, Q);
  for (int q = 0; q < Q; ++q) if (O[q] == 2) {
    chmin(qs[X[q]], q);
  }
  Mint ans = 0;
  vector<int> ds(N + 2, 0);
  vector<int> stack(N + 2);
  for (int q = 0; q < Q; ++q) if (O[q] == 1) {
    {
      int top = 0;
      stack[0] = -1;
      ds[L[q]] = 0;
      for (int x = L[q] + 1; x < R[q]; ++x) {
        if (qs[x] < Q) {
          for (; stack[top] >= qs[x]; --top) {}
          stack[++top] = qs[x];
        }
        ds[x] = top;
      }
    }
    {
      int top = 0;
      stack[0] = -1;
      ds[R[q] - 1] += 0;
      for (int x = R[q] - 1; x > L[q]; --x) {
        if (qs[x] < Q) {
          for (; stack[top] >= qs[x]; --top) {}
          stack[++top] = qs[x];
        }
        ds[x - 1] += top;
      }
    }
    for (int x = L[q]; x < R[q]; ++x) {
      ans += invTwo[ds[x]];
    }
  }
  return ans;
}
}  // sub3


int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    O.resize(Q);
    L.assign(Q, 0);
    R.assign(Q, 0);
    X.assign(Q, 0);
    for (int q = 0; q < Q; ++q) {
      scanf("%d", &O[q]);
      if (O[q] == 1) {
        scanf("%d%d", &L[q], &R[q]);
      } else {
        scanf("%d", &X[q]);
      }
    }
    
    bool spe3 = true;
    for (int q = 0; q < Q; ++q) if (O[q] == 2) {
      for (int qq = q; qq < Q; ++qq) spe3 = spe3 && (O[qq] == 2);
      break;
    }
    
    Mint ans = 0;
    if (spe3) {
      ans = sub3::run();
    } else if (N <= 5000 && Q <= 5000) {
      ans = brute::run();
    } else {
      assert(false);
    }
    printf("%u\n", ans.x);
  }
  return 0;
}