#line 1 "verify/yosupo/data-structure/segment-tree/lazy-segment-tree/range_affine_range_sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_range_sum"
#line 2 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
using i128 = __int128_t;
using u32 = uint32_t;
using u64 = uint64_t;
template<class T>
using PQ = priority_queue<T,vector<T>,greater<T>>;
const int INF=INT_MAX/2;
const ll LINF=LLONG_MAX/4;
const db DINF=numeric_limits<db>::infinity();
const db EPS=1e-9;
const db PI=acos(db(-1));
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SZ(a) (int)(a.size())
#define SORT(a) sort(ALL(a))
#define RSORT(a) sort(RALL(a))
#define REV(a) reverse(ALL(a))
#define UNI(a) a.erase(unique(ALL(a)),a.end())
#define LB(a,x) (int)(lower_bound(ALL(a),x)-a.begin())
#define UB(a,x) (int)(upper_bound(ALL(a),x)-a.begin())
#define FIND(a,x) (int)(find(ALL(a),x)-a.begin())
#define COUNT(a,x) (int)count(ALL(a),x)
#define MIN(a) *min_element(ALL(a))
#define MAX(a) *max_element(ALL(a))
template<class T,class U>
bool chmin(T &a,U b){return b<a?a=b,1:0;}
template<class T,class U>
bool chmax(T &a,U b){return a<b?a=b,1:0;}
template<class T>
T floor(T a,T b){return a/b-((a^b)<0&&a%b);}
template<class T>
T ceil(T a,T b){return a/b+((a^b)>=0&&a%b);}
int popcnt(ll x){return __builtin_popcountll(x);}
int topbit(ll x){return x==0?-1:63-__builtin_clzll(x);}
int lowbit(ll x){return x==0?-1:__builtin_ctzll(x);}
template<class T,class U>
T SUM(const U &a){return accumulate(ALL(a),T{});}
template<class T>
vector<int> argsort(const vector<T> &a){
vector<int> p(SZ(a));
iota(ALL(p),0);
stable_sort(ALL(p),[&](int i,int j){return a[i]<a[j];});
return p;
}
template<class T,size_t D=0>
struct VecBuilder{
array<size_t,D> d;
VecBuilder<T,D+1> operator[](size_t n)const{
VecBuilder<T,D+1> res{};
for(size_t i=0;i<D;i++)res.d[i]=d[i];
res.d[D]=n;
return res;
}
template<size_t I=0>
auto build(const T &x)const{
if constexpr(I+1==D)return vector<T>(d[I],x);
else return vector<decltype(build<I+1>(x))>(d[I],build<I+1>(x));
}
auto operator()(const T &x=T())const{
static_assert(D>0);
return build(x);
}
};
template<class T>
inline constexpr VecBuilder<T> VEC{};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
#line 2 "modular-arithmetic/modint.hpp"
/**
* Author: Teetat T.
* Date: 2026-04-15
* Description: modular arithmetic operations
*/
template<int mod,int root=0>
struct ModInt{
using mint = ModInt;
static_assert(mod>0,"mod must be positive");
int x;
constexpr ModInt():x(0){}
constexpr ModInt(ll x):x((x%=mod)<0?x+mod:x){}
constexpr explicit operator int()const{return x;}
constexpr int val()const{return x;}
constexpr static int get_mod(){return mod;}
constexpr static mint get_root(){return mint(root);}
constexpr mint operator-()const{
mint res;
res.x=x?mod-x:0;
return res;
}
constexpr mint operator+()const{return *this;}
constexpr mint inv()const{
int a=x,b=mod,u=1,v=0,q=0;
while(b>0){
q=a/b;
swap(a-=q*b,b);
swap(u-=q*v,v);
}
return mint(u);
}
constexpr mint pow(ll n)const{
mint res=1,a=*this;
for(;n>0;a*=a,n>>=1)if(n&1)res*=a;
return res;
}
constexpr mint &operator+=(const mint &o){
if((x+=o.x)>=mod)x-=mod;
return *this;
}
constexpr mint &operator-=(const mint &o){
if((x-=o.x)<0)x+=mod;
return *this;
}
constexpr mint &operator*=(const mint &o){
x=(ll(x)*o.x)%mod;
return *this;
}
constexpr mint &operator/=(const mint &o){
return *this*=o.inv();
}
constexpr mint operator+(const mint &o)const{return mint(*this)+=o;}
constexpr mint operator-(const mint &o)const{return mint(*this)-=o;}
constexpr mint operator*(const mint &o)const{return mint(*this)*=o;}
constexpr mint operator/(const mint &o)const{return mint(*this)/=o;}
constexpr mint &operator++(){return *this+=mint(1);}
constexpr mint &operator--(){return *this-=mint(1);}
constexpr mint operator++(int){mint res=*this;*this+=mint(1);return res;}
constexpr mint operator--(int){mint res=*this;*this-=mint(1);return res;}
constexpr bool operator==(const mint &o)const{return x==o.x;}
constexpr bool operator!=(const mint &o)const{return x!=o.x;}
constexpr bool operator<(const mint &o)const{return x<o.x;}
friend istream &operator>>(istream &is,mint &o){ll x{};is>>x;o=mint(x);return is;}
friend ostream &operator<<(ostream &os,const mint &o){return os<<o.x;}
};
using mint998 = ModInt<998244353,3>;
using mint107 = ModInt<1000000007>;
#line 2 "data-structure/segment-tree/lazy-segment-tree.hpp"
/**
* Author: Teetat T.
* Date: 2024-01-15
* Description: Segment Tree with Lazy Propagation
*/
template<class MonoidAction>
struct LazySegmentTree{
using InfoMonoid = typename MonoidAction::InfoMonoid;
using TagMonoid = typename MonoidAction::TagMonoid;
using Info = typename MonoidAction::Info;
using Tag = typename MonoidAction::Tag;
int n;
vector<Info> t;
vector<Tag> lz;
LazySegmentTree(){}
LazySegmentTree(int n,function<Info(int)> create){init(n,create);}
LazySegmentTree(int n,Info v=InfoMonoid::unit()){init(n,[&](int){return v;});}
template<class T>
LazySegmentTree(const vector<T> &a){init((int)a.size(),[&](int i){return Info(a[i]);});}
void init(int _n,function<Info(int)> create){
n=_n;
int m=4<<(31-__builtin_clz(n));
t.assign(m,InfoMonoid::unit());
lz.assign(m,TagMonoid::unit());
function<void(int,int,int)> build=[&](int l,int r,int i){
if(l==r)return void(t[i]=create(l));
int m=(l+r)/2;
build(l,m,i*2);
build(m+1,r,i*2+1);
pull(i);
};
build(0,n-1,1);
}
void pull(int i){
t[i]=InfoMonoid::op(t[i*2],t[i*2+1]);
}
void apply(int i,const Tag &v){
t[i]=MonoidAction::op(t[i],v);
lz[i]=TagMonoid::op(lz[i],v);
}
void push(int i){
apply(i*2,lz[i]);
apply(i*2+1,lz[i]);
lz[i]=TagMonoid::unit();
}
void modify(int l,int r,int i,int x,const Info &v){
if(x<l||r<x)return;
if(l==r)return void(t[i]=v);
int m=(l+r)/2;
push(i);
modify(l,m,i*2,x,v);
modify(m+1,r,i*2+1,x,v);
pull(i);
}
void modify(int x,const Info &v){
modify(0,n-1,1,x,v);
}
void update(int l,int r,int i,int x,int y,const Tag &v){
if(y<l||r<x)return;
if(x<=l&&r<=y)return apply(i,v);
int m=(l+r)/2;
push(i);
update(l,m,i*2,x,y,v);
update(m+1,r,i*2+1,x,y,v);
pull(i);
}
void update(int x,int y,const Tag &v){
update(0,n-1,1,x,y,v);
}
Info query(int l,int r,int i,int x,int y){
if(y<l||r<x)return InfoMonoid::unit();
if(x<=l&&r<=y)return t[i];
int m=(l+r)/2;
push(i);
return InfoMonoid::op(query(l,m,i*2,x,y),query(m+1,r,i*2+1,x,y));
}
Info query(int x,int y){
return query(0,n-1,1,x,y);
}
template<class F>
int findfirst(int l,int r,int i,int x,int y,const F &f){
if(y<l||r<x||!f(t[i]))return n;
if(l==r)return l;
int m=(l+r)/2;
push(i);
int res=findfirst(l,m,i*2,x,y,f);
if(res==n)res=findfirst(m+1,r,i*2+1,x,y,f);
return res;
}
template<class F>
int findfirst(int x,int y,const F &f){
return findfirst(0,n-1,1,x,y,f);
}
template<class F>
int findlast(int l,int r,int i,int x,int y,const F &f){
if(y<l||r<x||!f(t[i]))return -1;
if(l==r)return l;
int m=(l+r)/2;
push(i);
int res=findlast(m+1,r,i*2+1,x,y,f);
if(res==-1)res=findlast(l,m,i*2,x,y,f);
return res;
}
template<class F>
int findlast(int x,int y,const F &f){
return findlast(0,n-1,1,x,y,f);
}
};
#line 2 "group/monoid/affine.hpp"
/**
* Author: Teetat T.
* Date: 2024-04-14
* Description: Affine Transformation Monoid class.
*/
template<class T>
struct AffineMonoid{
using P = pair<T,T>;
using value_type = P;
static constexpr P op(const P &x,const P &y){
return P(x.first*y.first,x.second*y.first+y.second);
}
static constexpr P unit(){return P(T(1),T(0));}
static constexpr T eval(const P &f,const T &x){
return f.first*x+f.second;
}
};
#line 2 "group/monoid/add-count.hpp"
/**
* Author: Teetat T.
* Date: 2024-04-14
* Description: Add & Count Monoid class.
*/
template<class T>
struct AddCountMonoid{
using P = pair<T,ll>;
using value_type = P;
static constexpr P op(const P &x,const P &y){
return P(x.first+y.first,x.second+y.second);
}
static constexpr P inverse(const P &x){return P(-x.first,-x.second);}
static constexpr P unit(){return P(T(0),0LL);}
static constexpr P make(const T &x){return P(x,1LL);}
};
#line 4 "group/monoid-action/add-count-affine.hpp"
/**
* Author: Teetat T.
* Date: 2024-04-14
* Description: Affine to Add & Count Action class.
*/
template<class T>
struct AddCountAffineAction{
using InfoMonoid = AddCountMonoid<T>;
using TagMonoid = AffineMonoid<T>;
using Info = typename InfoMonoid::value_type;
using Tag = typename TagMonoid::value_type;
static constexpr Info op(const Info &a,const Tag &b){
return Info(a.first*b.first+T(a.second)*b.second,a.second);
}
};
#line 6 "verify/yosupo/data-structure/segment-tree/lazy-segment-tree/range_affine_range_sum.test.cpp"
using mint = mint998;
using Monoid = AddCountMonoid<mint>;
using Action = AddCountAffineAction<mint>;
using T = Monoid::value_type;
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
int n,q;
cin >> n >> q;
vector<mint> a(n);
for(auto &x:a)cin >> x;
LazySegmentTree<Action> s(n,[&](int i){return Monoid::make(a[i]);});
while(q--){
int op;
cin >> op;
if(op){
int l,r;
cin >> l >> r;
cout << s.query(l,r-1).first << "\n";
}else{
int l,r,b,c;
cin >> l >> r >> b >> c;
s.update(l,r-1,T(b,c));
}
}
}
verify/yosupo/data-structure/segment-tree/lazy-segment-tree/range_affine_range_sum.test.cpp