#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, inf = 1e9 + 6;

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;
    if(val == 2 && _b == mod - 2) return (mod + 1) / 2;
    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], p2[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;
}

void S3(int cmax, int q) {
   vector<pii> segm;
   for(int tc = 1, t; tc <= q; tc++) {
      cin >> t;
      if(t == 1) {
         int l, r;
         cin >> l >> r;
         segm.emplace_back(l, r);
      }
      else {
         int x;
         cin >> x;
         cut[x] = tc;
      }
   }
   
   vector<Mint> rez(sz(segm));
   int n = sz(segm);
   
   auto sweep = [&]() {
      vector<pair<int, Mint>> st;
      vector<Mint> spart;
      cut[0] = -inf;
      st.emplace_back(0, 0);
      spart.emplace_back(0);
      
      vector<vector<pii>> qs(cmax + 1, vector<pii>());
      int II = 0;
      for(auto [l, r] : segm)
         qs[r].emplace_back(l, II++);
      
      for(int i = 1; i <= cmax; i++) {
         bool revert = 0;
         if(cut[i] == 0)
            revert = 1;
         
         Mint sum = i - st.back().first;
         spart.emplace_back(spart.back() + sum * ip2[sz(st) - 1]);
         st.emplace_back(i, sum);
         //cerr << " ! " << i << ' ' << sz(st) << ' ' << sum.val << '\n';
         
         for(auto [l, idx] : qs[i]) {
            
            //cerr << l << ' ' << idx << '\n';
            //for(auto [a, b] : st) cerr << '\t' << a << ' ' << b.val <<'\n';
            //for(auto a : spart) cerr << '\t' << '\t' << a.val <<'\n';
            
            auto it = distance(st.begin(), upper_bound(all(st), make_pair(l, Mint(0)), [&](pair<int, Mint> a, pair<int, Mint> b) { return a.first < b.first; })) - 1;
            
            //cerr << '\t' << it << '\n';
            
            rez[idx] += (spart.back() - spart[it + 1]) * p2[it];
            //cerr << '\t' << ((spart.back() - spart[it + 1]) * p2[it]).val << '\n';
         }
         
         if(revert) {
            st.pop_back();
            spart.pop_back();
         }
         else {
            st.pop_back();
            spart.pop_back();
            while(cut[i] < cut[st.back().first]) {
               sum = sum / 2 + st.back().second / 2;
               st.pop_back();
               spart.pop_back();
            }
            spart.emplace_back(spart.back() + sum * ip2[sz(st)]);
            st.emplace_back(i, sum);
         }
      }
   };
   
   sweep();
   for(auto& [l, r] : segm) {
      r = cmax - r + 1;
      l = cmax - l + 1;
      swap(l, r);
   }
   reverse(cut + 1, cut + cmax + 1);
   sweep();
   
   Mint total;
   for(int i = 0; i < n; i++) {
      total += rez[i];
      if(rez[i].val == 0) total += segm[i].second - segm[i].first;
   }
   cout << total.val << '\n';
}

signed main() {
   ip2[0] = 1;
   p2[0] = 1;
   for(int i = 1; i < nmax; i++)
      ip2[i] = ip2[i - 1] * ((mod + 1) / 2),
      p2[i] = p2[i - 1] * 2;
   
   //cerr << ip2[1].val << ' ' << ip2[2].val << '\n';
      
   cin.tie(0) -> sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
      
   #ifdef DLOCAL
      S3(n, q);
      exit(0);
   #endif
      
   if(q <= 5e3) {
      Brut(n, q);
      exit(0);
   }
   else {
      S3(n, q);
   }
   
   
   
}

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