#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 5e4 + 5;

const int mod = 998244353;
struct Mint {
  int val;
  Mint(ll x = 0): val((x % mod + mod) % mod) {;}
  Mint operator +(const Mint& x) const { return Mint(val + x.val); }
  Mint operator -(const Mint& x) const { return Mint(val - x.val); }
  Mint operator *(const Mint& x) const { return Mint((ll)val * x.val); }
  Mint operator +=(const Mint& x) { return *this = Mint(val + x.val); }
  Mint operator -=(const Mint& x) { return *this = Mint(val - x.val); }
  Mint operator *=(const Mint& x) { return *this = Mint((ll)val * x.val); }
  Mint operator ^(const int& _b) const {
    Mint accum = 1, a = *this;
    int b = _b;
    while(b) {
      accum = (b & 1? accum * a : accum);
      a *= a;
      b >>= 1;
    }
    return accum;
  }
  Mint operator /(const Mint& x) { return Mint((ll)val * (x ^ (mod - 2)).val); }
  Mint operator /=(const Mint& x) { return *this = Mint((ll)val * (x ^ (mod - 2)).val); }
};

int cut[nmax];
Mint ip2[nmax];

void Brut(int n, int q) {   
   vector<pair<pii, Mint>> segm;
   for(int tc = 0; tc < q; tc++) {
      int t;
      cin >> t;
      if(t == 1) {
         int l, r;
         cin >> l >> r;
         segm.emplace_back(make_pair(l, r), 1);
      }
      else {
         int x;
         cin >> x;
         for(int i = 0; i < sz(segm); i++) {
            auto [a, m] = segm[i];
            auto [l, r] = a;
            if(l < x && x < r) {
               segm[i] = make_pair(make_pair(l, x), m * ((mod + 1) / 2));
               segm.emplace_back(make_pair(x, r), m * ((mod + 1) / 2));
            }
         }
      }
   }
   
   Mint total;
   for(auto [a, m] : segm) {
      auto [l, r] = a;
      total += Mint(r - l) * m;
   }
   cout << total.val;
   return;
}

signed main() {
   ip2[0] = 1;
   for(int i = 1; i < nmax; i++)
      ip2[i] = ip2[i - 1] * ((mod + 1) / 2);
   
   cin.tie(0) -> sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
      
   if(q <= 5e3) {
      Brut(n, q);
      exit(0);
   }
   
   
   
}

/**
      Istenem! Nu poate fi real.
-- Surse verificate
*/