#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int N = 100005, P = 998244353;

int n, q, cnt;
int rt[N * 4];
struct node {
    int ls, rs, v;
} T[N * 400];
inline i64 poww(i64 a, i64 b) {
    i64 r = 1;
    for (; b; b >>= 1, a = a * a % P) if (b & 1) r = r * a % P;
    return r;
}
inline i64 mul(i64 p, i64 q) {
    i64 r = p * q % P;
    r = (r + (1 - p) * (1 - q) % P) % P;
    return (r + P) % P;
}

void changey(int &o, int l, int r, int x, int y, i64 p) {
    if (!o) o = ++cnt, T[o].v = 1; 
    if (x <= l && y >= r) return T[o].v = mul(T[o].v, p), void(); 
    int mid = l + r >> 1; 
    if (x <= mid) changey(T[o].ls, l, mid, x, y, p);
    if (mid < y) changey(T[o].rs, mid + 1, r, x, y, p);
}
void changex(int o, int l, int r, int lx, int rx, int ly, int ry, i64 p) {
    if (lx <= l && rx >= r) return changey(rt[o], 1, n, ly, ry, p); 
    int mid = (l + r) >> 1;
    if (lx <= mid) changex(o << 1, l, mid, lx, rx, ly, ry, p);
    if (mid < rx) changex(o << 1 | 1, mid + 1, r, lx, rx, ly, ry, p);
}

i64 asky(int o, int l, int r, int x) {
    if (!o) return 1; 
    if (l == r) return T[o].v; 
    int mid = (l + r) >> 1; 
    if (x <= mid) return mul(T[o].v, asky(T[o].ls, l, mid, x)); 
    return mul(T[o].v, asky(T[o].rs, mid + 1, r, x)); 
}
i64 askx(int o, int l, int r, int x, int y) {
    if (l == r) return asky(rt[o], 1, n, y); 
    int mid = l + r >> 1; 
    if (x <= mid) return mul(askx(o << 1, l, mid, x, y), asky(rt[o], 1, n, y)); 
    return mul(askx(o << 1 | 1, mid + 1, r, x, y), asky(rt[o], 1, n, y)); 
}

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> q;
    while (q--) {
        int op, l, r; cin >> op >> l >> r;
        if (op == 1) {
            i64 p = poww(r - l + 1, P - 2);
            if (l > 1) 
                changex(1, 0, n, 1, l - 1, l, r, (1 - p + P) % P), 
                changex(1, 0, n, 0, 0, 1, l - 1, 0); 
            if (r < n) 
                changex(1, 0, n, l, r, r + 1, n, (1 - p + P) % P), 
                changex(1, 0, n, 0, 0, r + 1, n, 0);
            changex(1, 0, n, l, r, l, r, (1 - 2 * p + P) % P); 
            changex(1, 0, n, 0, 0, l, r, p); 
        } else cout << askx(1, 0, n, l - 1, r) << "\n"; 
    }
    return 0;
}