//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
//using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
template<typename T,typename OT>
struct LinkCutTree{
  using F = function<T(T, T)>;
  using G = function<T(T, OT)>;
  using H = function<OT(OT, OT)>;
  using S = function<T(T)>;
  struct Node{
    Node *p,*l,*r;
    int idx;
    T key, sum;
    OT lazy;
    int sz;
    bool rev;
    bool is_root(){
      return !p || (p->l != this && p->r != this);
    }
    Node(int idx, const T &key,const OT &om):
      idx(idx),key(key),sum(key),lazy(om),sz(1),
      l(nullptr),r(nullptr),p(nullptr),rev(false){}
  };
  const T M1;
  const OT OM0;
  const F f;
  const G g;
  const H h;
  const S s;
  vector<Node *>ver;
  LinkCutTree(int n):
    LinkCutTree(n,[&](T x,T y){return x;},[&](T x){return x;},T()){}
  LinkCutTree(int n,const F &f,const S &s,const T M1):
    LinkCutTree(n,f,G(),H(),s,M1,OT()){}
  LinkCutTree(int n,const F &f,const G &g,const H &h, const S &s,const T M1,const OT OM0)
    :f(f),g(g),h(h),s(s),ver(n),M1(M1),OM0(OM0){}
  void update(Node *t){
    t->sz = 1;
    t->sum = t->key;
    if(t->l)t->sz += t->l->sz, t->sum = f(t->l->sum, t->sum);
    if(t->r)t->sz += t->r->sz, t->sum = f(t->sum, t->r->sum);
  }
  void rotr(Node *t){
    Node *x = t->p, *y = x->p;
    if((x->l = t->r))t->r->p = x;
    t->r = x, x->p = t;
    update(x),update(t);
    if((t->p = y)){
      if(y->l == x)y->l = t;
      if(y->r == x)y->r = t;
      update(y);
    }
  }
  void rotl(Node *t){
    Node *x =t->p, *y = x->p;
    if((x->r = t->l))t->l->p = x;
    t->l = x, x->p = t;
    update(x),update(t);
    if((t->p = y)){
      if(y->l == x)y->l = t;
      if(y->r == x)y->r = t;
      update(y);
    }
  }
  void splay(Node *t){
    push(t);
    while(!t->is_root()){
      Node *q = t->p;
      if(q->is_root()){
        push(q), push(t);
        if(q->l == t)rotr(t);
        else rotl(t);
      }
      else{
        Node *r = q->p;
        push(r), push(q), push(t);
        if(r->l == q){
          if(q->l == t)rotr(q), rotr(t);
          else rotl(t), rotr(t);
        }
        else{
          if(q->r == t)rotl(q), rotl(t);
          else rotr(t), rotl(t);
        }
      }
    }
  }
  Node *expose(Node *t){
    Node *rp = nullptr;
    Node *cur = t;
    while(cur){
      splay(cur);
      cur->r = rp;
      update(cur);
      rp = cur;
      cur = cur->p;
    }
    splay(t);
    return rp;
  }
  void link(Node *child, Node *parent){
    expose(child);
    expose(parent);
    child->p = parent;
    parent->r = child;
    update(parent);
  }
  void cut(Node *child){
    expose(child);
    Node *parent = child->l;
    child->l = nullptr;
    parent->p = nullptr;
    update(child);
  }
  void toggle(Node *t){
    assert(t);
    swap(t->l,t->r);
    t->sum = s(t->sum);
    t->rev^=true;
  }
  void evert(Node *t){
    expose(t);
    toggle(t);
    push(t);
  }
  Node *make_node(int idx,T v = T()){
    return new Node(idx, v, OM0);
  }
  void push(Node *t){
    if(t->lazy != OM0){
      if(t->l)propagate(t->l, t->lazy);
      if(t->r)propagate(t->r, t->lazy);
      t->lazy = OM0;
    }
    if(t->rev){
      if(t->l)toggle(t->l);
      if(t->r)toggle(t->r);
      t->rev=false;
    }
  }
  Node *lca(Node *u, Node *v){
    expose(u);
    return expose(v);
  }
  void propagate(Node *t, const OT x){
    t->lazy = h(t->lazy, x);
    t->key = g(t->key, x);
    t->sum = g(t->sum, x);
  }
  //ここから操作
  void add_vertex(int idx,T v = T()){//頂点idxの追加
    ver[idx] = make_node(idx, v);
  }
  void evert(int x){//根をxに
    evert(ver[x]);
  }
  void add_edge(int x,int y){//(x->y)の追加
    evert(y);
    link(ver[y],ver[x]);
  }
  void cut_edge(int x,int y){
    evert(x);
    cut(ver[y]);
  }
  T val(int x){
    return ver[x]->key;
  }
  T val_path(int x){//根~xのパスクエリ
    expose(ver[x]);
    return ver[x]->sum;
  }
  T val_path(int x,int y){//x->yのパスクエリ
    evert(x);
    return val_path(y);
  }
  void update(int x,T v){//頂点xの値をvに
    expose(ver[x]);
    ver[x]->key = v;
    update(ver[x]);
  }
  void update_path(int x,const OT v){//根~xのパス更新
    expose(ver[x]);
    propagate(ver[x], v);
    push(ver[x]);
  }
  void update_path(int x,int y,const OT v){//x~yのパス更新
    evert(x);
    update_path(y,v);
  }
  int lca(int x,int y){
    return lca(ver[x], ver[y])->idx;
  }
  bool connected(int x,int y){//頂点xとyが連結か？
    expose(ver[x]);
    expose(ver[y]);
    return bool(ver[x]->p);
  }
};
template< int mod >
struct ModInt {
  int x;
 
  ModInt() : x(0) {}
 
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
 
  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }
 
  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
 
  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }
 
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
 
  ModInt operator-() const { return ModInt(-x); }
 
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
 
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
 
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
 
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
 
  bool operator==(const ModInt &p) const { return x == p.x; }
 
  bool operator!=(const ModInt &p) const { return x != p.x; }
 
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
 
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
 
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }
 
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }
 
  static int get_mod() { return mod; }
};
using modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}
//using modint=ld;
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  using P=pair<modint,modint>;
  auto ff=[&](P x,P y){
    return MP(x.fi+y.fi,x.se+y.se);
  };
  auto gg=[&](P x,P y){
    return MP(y.fi*x.fi+x.se*y.se,x.se);
  };
  auto hh=[&](P x,P y){
    return MP(x.fi*y.fi,y.fi*x.se+y.se);
  };
  auto ss=[&](P x){
    return x;
  };
  ll n,q;cin>>n>>q;
  LinkCutTree<P,P>lck(n,ff,gg,hh,ss,MP(0,0),MP(1,0));
  vector<ll>a(n);
  rep(i,0,n){
    cin>>a[i];
    lck.add_vertex(i,MP(a[i],1));
  }
  rep(i,0,n-1)lck.add_edge(i,i+1);
  while(q--){
    ll t;cin>>t;
    if(t==0){
      ll l,r,b,c;cin>>l>>r>>b>>c;r--;
      lck.update_path(l,r,MP(b,c));
    }
    else{
      ll l,r;cin>>l>>r;r--;
      cout<<lck.val_path(l,r).fi<<endl;
    }
  }
  return 0;
}

Measured memory_bytes: 50192