#include<bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(int i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
using P = pair<ll, ll>;
#define VEC(type, name, size)\
    V<type> name(size);\
    IN(name)
#define VVEC(type, name, h, w)\
    VV<type> name(h, V<type>(w));\
    IN(name)
#define INT(...)\
    int __VA_ARGS__;\
    IN(__VA_ARGS__)
#define LL(...)\
    ll __VA_ARGS__;\
    IN(__VA_ARGS__)
#define STR(...)\
    string __VA_ARGS__;\
    IN(__VA_ARGS__)
#define CHAR(...)\
    char __VA_ARGS__;\
    IN(__VA_ARGS__)
#define DOUBLE(...)\
    DOUBLE __VA_ARGS__;\
    IN(__VA_ARGS__)
#define LD(...)\
    LD __VA_ARGS__;\
    IN(__VA_ARGS__)
template <class T> void scan(T a) { cin >> a; }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(V<T> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T> void scan(V<T> &a) { for(auto &i : a) scan(i); }
template <class T, class L> void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &... tail) { scan(head); IN(tail...); }
template <class T> inline void print(T x){ cout << x << '\n';}
struct inputoutputfaster{
    inputoutputfaster(){
        ios::sync_with_stdio(false);\
        cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
}inputoutputfaster_;
template <class T> V<T> press(V<T> &x){ 
    V<T> res = x;
    sort(all(res));
    res.erase(unique(all(res)), res.end());
    REP(i, SZ(x)){
        x[i] = lower_bound(all(res), x[i]) - res.begin();
    }
    return res;
}
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true; }return false; }
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true; }return false; }
inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';}
inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';}
inline void err(bool b = true) {if(b) {cout << -1 << '\n'; exit(0);}}
template<class T> inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n'; exit(0);}}
template<class T> T divup(T x, T y) {return (x+(y-1))/y;}
template <typename T> T pow(T a, long long n, T e = 1) {T ret = e; while (n) {if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; }
const ll INF = 1e18;
#pragma endregion

template <class Monoid, class E>
struct LazySegmentTree{
private:
    using F = function<Monoid(Monoid, Monoid)>;
    using G = function<Monoid(Monoid, E)>;
    using H = function<E(E, E)>;
    int n, height;
    V<Monoid> Node;
    V<E> Lazy;
    F f;
    G g;
    H h;
    Monoid Monoid_unit, init_data;
    E e_unit;

    void build(V<Monoid> vec){
        Node.assign(2 * n, init_data);
        REP(i, n) Node[i + n] = vec[i];
        RREP(i, n) Node[i] = f(Node[i << 1], Node[i << 1 | 1]);
        Lazy.assign(2 * n, e_unit);
        height = 0;
        for(int i = 1; i <= n; i *= 2) height++;
    }

    void eval(int left, int right){
        left += n, right += n - 1;
        RREPS(i, height){
            int l = left >> i, r = right >> i;
            Lazy[l << 1] = h(Lazy[l << 1], Lazy[l]);
			Lazy[l << 1 | 1] = h(Lazy[l << 1 | 1], Lazy[l]);
			Node[l] = g(Node[l], Lazy[l]);
			Lazy[l] = e_unit;
			Lazy[r << 1] = h(Lazy[r << 1], Lazy[r]);
			Lazy[r << 1 | 1] = h(Lazy[r << 1 | 1], Lazy[r]);
			Node[r] = g(Node[r], Lazy[r]);
			Lazy[r] = e_unit;
        }
    }

public:
    LazySegmentTree(V<Monoid> vec, F f_, G g_, H h_, Monoid Monoid_unit_, E e_unit_)
    :n(SZ(vec)), f(f_), g(g_), h(h_), Monoid_unit(Monoid_unit_), e_unit(e_unit_){
        build(vec);
    }

    LazySegmentTree(int n_, F f_, G g_, H h_, Monoid Monoid_unit_, E e_unit_)
    :n(n_), f(f_), g(g_), h(h_), Monoid_unit(Monoid_unit_), e_unit(e_unit_), init_data(Monoid_unit_){
        build(V<Monoid>(n, init_data));
    }

    LazySegmentTree(int n_, F f_, G g_, H h_, Monoid Monoid_unit_, E e_unit_, Monoid init_data_)
    :n(n_), f(f_), g(g_), h(h_), Monoid_unit(Monoid_unit_), e_unit(e_unit_), init_data(init_data_){
        build(V<Monoid>(n, init_data));
    }

    void update(int left, int right, E operator_){
        eval(left, right);
        left += n, right += n;
		int L0 = left / (left & -left);
		int R0 = right / (right & -right);
		while(left < right) {
			if(left & 1) Lazy[left] = h(Lazy[left], operator_);
			if(right & 1) Lazy[right - 1] = h(Lazy[right - 1], operator_);
			(left += 1) >>= 1;
			right >>= 1;
		}
		left = L0;
		right = R0;
		while(left > 1) {
			left >>= 1;
			Node[left] = f(g(Node[left << 1], Lazy[left << 1]), g(Node[left << 1 | 1], Lazy[left << 1 | 1]));
			Lazy[left] = e_unit;
		}
		while(right > 1) {
			right >>= 1;
			Node[right] = f(g(Node[right << 1], Lazy[right << 1]), g(Node[right << 1 | 1], Lazy[right << 1 | 1]));
			Lazy[right] = e_unit;
		}
    }

    //半開区間[a, b)の区間クエリ
    Monoid query(int left, int right) {  
		eval(left, right);
		Monoid a = Monoid_unit, b = Monoid_unit;
		left += n, right += n;
		while(left < right){
			if(left & 1) a = f(a, g(Node[left], Lazy[left]));
			if(right & 1) b = f(g(Node[right - 1], Lazy[right - 1]), b);
			(left += 1) >>= 1;
			right >>= 1;
		}
		return f(a, b);
	}

    Monoid operator[](int i) {
        return query(i, i + 1);
    }
};

//Modulo Calculation
const int MOD = 998244353;

//ModInt
template <int mod>
struct ModInt {
    int x;
    ModInt() : x(0) {}
    ModInt(ll x_) {
        if ((x = x_ % mod + mod) >= mod) x -= mod;
    }
    ModInt& operator+=(ModInt rhs) {
        if ((x += rhs.x) >= mod) x -= mod;
        return *this;
    }
    ModInt& operator-=(ModInt rhs) {
        if ((x -= rhs.x) < 0) x += mod;
        return *this;
    }
    ModInt& operator*=(ModInt rhs) {
        x = (unsigned long long)x * rhs.x % mod;
        return *this;
    }
    ModInt& operator/=(ModInt rhs) {
        x = (unsigned long long)x * rhs.inv().x % mod;
        return *this;
    }
  
    ModInt operator-() const { return -x < 0 ? mod - x : -x; }
    ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
    ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
    ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
    ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
    ModInt &operator++ () { *this += 1; return *this;}
    ModInt operator++ (int) { *this += 1; return *this - 1;}
    ModInt &operator-- () { *this -= 1; return *this;}
    ModInt operator-- (int) { *this -= 1; return *this + 1;}
    bool operator==(ModInt rhs) const { return x == rhs.x; }    
    bool operator!=(ModInt rhs) const { return x != rhs.x; }
    bool operator<=(ModInt rhs) const { return x <= rhs.x; }
    bool operator>=(ModInt rhs) const { return x >= rhs.x; }
    bool operator<(ModInt rhs) const { return x < rhs.x; }
    bool operator>(ModInt rhs) const { return x > rhs.x; }
    ModInt inv() const { return pow(*this, mod - 2); }
  
    friend ostream& operator<<(ostream& s, ModInt<mod> a) {
        s << a.x;
        return s;
    }
    friend istream& operator>>(istream& s, ModInt<mod>& a) {
        s >> a.x;
        return s;
    }
};
using mint = ModInt<MOD>;

int main(){
    INT(n, q);
    using M = pair<mint, mint>;
    using E = pair<mint, mint>;
    VEC(int, a, n);
    V<M> vec(n);
    REP(i, n) vec[i] = {a[i], 1};
    auto f = [](M a, M b){return M(a.first + b.first, a.second + b.second);};
    auto g = [](M a, E b){return M(a.first * b.first + a.second * b.second, a.second);};
    auto h = [](E a, E b){return E(a.first * b.first, a.second * b.first + b.second);};
    M m_uni(0, 0);
    E e_uni(1, 0);
    LazySegmentTree<M,E> ST(vec, f, g, h, m_uni, e_uni);
    while(q--){
        INT(t);
        if(t){
            INT(l, r);
            print(ST.query(l, r).first);
        }
        else{
            INT(l, r, b, c);
            ST.update(l, r, E(b, c));
        }
    }
}

Measured memory_bytes: 32524