#line 1 "/home/maspy/compro/library/my_template.hpp" #include using namespace std; using ll = long long; using pi = pair; using vi = vector; using u32 = unsigned int; using u64 = unsigned long long; using i128 = __int128; template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using vvvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; #define vec(type, name, ...) vector name(__VA_ARGS__) #define vv(type, name, h, ...) \ vector> name(h, vector(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector>> name( \ h, vector>(w, vector(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector>>> name( \ a, vector>>( \ b, vector>(c, vector(__VA_ARGS__)))) // https://trap.jp/post/1224/ #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define FOR_R(...) \ overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s)) #define all(x) x.begin(), x.end() #define len(x) ll(x.size()) #define elif else if #define eb emplace_back #define mp make_pair #define mt make_tuple #define fi first #define se second #define stoi stoll template T SUM(vector &A) { T sum = T(0); for (auto &&a: A) sum += a; return sum; } #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()) int popcnt(int x) { return __builtin_popcount(x); } int popcnt(u32 x) { return __builtin_popcount(x); } int popcnt(ll x) { return __builtin_popcountll(x); } int popcnt(u64 x) { return __builtin_popcountll(x); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2) int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2) int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template T ceil(T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); } template T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); } template pair divmod(T x, U y) { T q = floor(x, y); return {q, x - q * y}; } ll binary_search(function check, ll ok, ll ng) { assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; if (check(x)) ok = x; else ng = x; } return ok; } template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } vi s_to_vi(const string &S, char first_char) { vi A(S.size()); FOR(i, S.size()) { A[i] = S[i] - first_char; } return A; } template vector cumsum(vector &A, int off = 1) { int N = A.size(); vector B(N + 1); FOR(i, N) { B[i + 1] = B[i] + A[i]; } if (off == 0) B.erase(B.begin()); return B; } template vc bincount(const vc &A, int size) { vc C(size); for (auto &&x: A) { ++C[x]; } return C; } template vector argsort(const vector &A) { // stable vector ids(A.size()); iota(all(ids), 0); sort(all(ids), [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); }); return ids; } // A[I[0]], A[I[1]], ... template vc rearrange(const vc &A, const vc &I) { int n = len(A); assert(len(I) == n); vc B(n); FOR(i, n) B[i] = A[I[i]]; return B; } #line 1 "/home/maspy/compro/library/other/io.hpp" // based on yosupo's fastio #include namespace detail { template std::true_type check_value(int); template std::false_type check_value(long); } // namespace detail template struct is_modint : decltype(detail::check_value(0)) {}; template using is_modint_t = enable_if_t::value>; template using is_not_modint_t = enable_if_t::value>; struct Scanner { FILE *fp; char line[(1 << 15) + 1]; size_t st = 0, ed = 0; void reread() { memmove(line, line + st, ed - st); ed -= st; st = 0; ed += fread(line + ed, 1, (1 << 15) - ed, fp); line[ed] = '\0'; } bool succ() { while (true) { if (st == ed) { reread(); if (st == ed) return false; } while (st != ed && isspace(line[st])) st++; if (st != ed) break; } if (ed - st <= 50) { bool sep = false; for (size_t i = st; i < ed; i++) { if (isspace(line[i])) { sep = true; break; } } if (!sep) reread(); } return true; } template ::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; while (true) { size_t sz = 0; while (st + sz < ed && !isspace(line[st + sz])) sz++; ref.append(line + st, sz); st += sz; if (!sz || st != ed) break; reread(); } return true; } template ::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; bool neg = false; if (line[st] == '-') { neg = true; st++; } ref = T(0); while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); } if (neg) ref = -ref; return true; } template * = nullptr> bool read_single(T &ref) { long long val = 0; bool f = read_single(val); ref = T(val); return f; } bool read_single(double &ref) { string s; if (!read_single(s)) return false; ref = std::stod(s); return true; } bool read_single(char &ref) { string s; if (!read_single(s) || s.size() != 1) return false; ref = s[0]; return true; } template bool read_single(vector &ref) { for (auto &d: ref) { if (!read_single(d)) return false; } return true; } template bool read_single(pair &p) { return (read_single(p.first) && read_single(p.second)); } template bool read_single(tuple &p) { return (read_single(get<0>(p)) && read_single(get<1>(p)) && read_single(get<2>(p))); } template bool read_single(tuple &p) { return (read_single(get<0>(p)) && read_single(get<1>(p)) && read_single(get<2>(p)) && read_single(get<3>(p))); } void read() {} template void read(H &h, T &... t) { bool f = read_single(h); assert(f); read(t...); } Scanner(FILE *fp) : fp(fp) {} }; struct Printer { Printer(FILE *_fp) : fp(_fp) {} ~Printer() { flush(); } static constexpr size_t SIZE = 1 << 15; FILE *fp; char line[SIZE], small[50]; size_t pos = 0; void flush() { fwrite(line, 1, pos, fp); pos = 0; } void write(const char &val) { if (pos == SIZE) flush(); line[pos++] = val; } template ::value, int> = 0> void write(T val) { if (pos > (1 << 15) - 50) flush(); if (val == 0) { write('0'); return; } if (val < 0) { write('-'); val = -val; // todo min } size_t len = 0; while (val) { small[len++] = char(0x30 | (val % 10)); val /= 10; } for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; } pos += len; } void write(const string &s) { for (char c: s) write(c); } void write(const char *s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) write(s[i]); } void write(const double &x) { ostringstream oss; oss << setprecision(15) << x; string s = oss.str(); write(s); } void write(const long double &x) { ostringstream oss; oss << setprecision(15) << x; string s = oss.str(); write(s); } template * = nullptr> void write(T &ref) { write(ref.val); } template void write(const vector &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } template void write(const pair &val) { write(val.first); write(' '); write(val.second); } template void write(const tuple &val) { auto &[a, b, c] = val; write(a), write(' '), write(b), write(' '), write(c); } template void write(const tuple &val) { auto &[a, b, c, d] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d); } template void write(const tuple &val) { auto &[a, b, c, d, e] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e); } template void write(const tuple &val) { auto &[a, b, c, d, e, f] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f); } template void write(const array &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } void write(i128 val) { string s; bool negative = 0; if(val < 0){ negative = 1; val = -val; } while (val) { s += '0' + int(val % 10); val /= 10; } if(negative) s += "-"; reverse(all(s)); if (len(s) == 0) s = "0"; write(s); } }; Scanner scanner = Scanner(stdin); Printer printer = Printer(stdout); void flush() { printer.flush(); } void print() { printer.write('\n'); } template void print(Head &&head, Tail &&... tail) { printer.write(head); if (sizeof...(Tail)) printer.write(' '); print(forward(tail)...); } void read() {} template void read(Head &head, Tail &... tail) { scanner.read(head); read(tail...); } #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ read(__VA_ARGS__) #define DBL(...) \ double __VA_ARGS__; \ read(__VA_ARGS__) #define VEC(type, name, size) \ vector name(size); \ read(name) #define VV(type, name, h, w) \ vector> name(h, vector(w)); \ read(name) void YES(bool t = 1) { print(t ? "YES" : "NO"); } void NO(bool t = 1) { YES(!t); } void Yes(bool t = 1) { print(t ? "Yes" : "No"); } void No(bool t = 1) { Yes(!t); } void yes(bool t = 1) { print(t ? "yes" : "no"); } void no(bool t = 1) { yes(!t); } #line 2 "/home/maspy/compro/library/mod/modint.hpp" template struct modint { static constexpr bool is_modint = true; u32 val; constexpr modint(const ll val = 0) noexcept : val(val >= 0 ? val % mod : (mod - (-val) % mod) % mod) {} bool operator<(const modint &other) const { return val < other.val; } // To use std::map modint &operator+=(const modint &p) { if ((val += p.val) >= mod) val -= mod; return *this; } modint &operator-=(const modint &p) { if ((val += mod - p.val) >= mod) val -= mod; return *this; } modint &operator*=(const modint &p) { val = (u32)(1LL * val * p.val % mod); return *this; } modint &operator/=(const modint &p) { *this *= p.inverse(); return *this; } modint operator-() const { return modint(get_mod() - val); } 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 val == p.val; } bool operator!=(const modint &p) const { return val != p.val; } modint inverse() const { int a = val, 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(val); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } static constexpr u32 get_mod() { return mod; } }; struct ArbitraryModInt { static constexpr bool is_modint = true; u32 val; ArbitraryModInt() : val(0) {} ArbitraryModInt(int64_t y) : val(y >= 0 ? y % get_mod() : (get_mod() - (-y) % get_mod()) % get_mod()) {} bool operator<(const ArbitraryModInt &other) const { return val < other.val; } // To use std::map static u32 &get_mod() { static u32 mod = 0; return mod; } static void set_mod(int md) { get_mod() = md; } ArbitraryModInt &operator+=(const ArbitraryModInt &p) { if ((val += p.val) >= get_mod()) val -= get_mod(); return *this; } ArbitraryModInt &operator-=(const ArbitraryModInt &p) { if ((val += get_mod() - p.val) >= get_mod()) val -= get_mod(); return *this; } ArbitraryModInt &operator*=(const ArbitraryModInt &p) { unsigned long long a = (unsigned long long)val * p.val; unsigned xh = (unsigned)(a >> 32), xl = (unsigned)a, d, m; asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(get_mod())); val = m; return *this; } ArbitraryModInt &operator/=(const ArbitraryModInt &p) { *this *= p.inverse(); return *this; } ArbitraryModInt operator-() const { return ArbitraryModInt(get_mod() - val); } ArbitraryModInt operator+(const ArbitraryModInt &p) const { return ArbitraryModInt(*this) += p; } ArbitraryModInt operator-(const ArbitraryModInt &p) const { return ArbitraryModInt(*this) -= p; } ArbitraryModInt operator*(const ArbitraryModInt &p) const { return ArbitraryModInt(*this) *= p; } ArbitraryModInt operator/(const ArbitraryModInt &p) const { return ArbitraryModInt(*this) /= p; } bool operator==(const ArbitraryModInt &p) const { return val == p.val; } bool operator!=(const ArbitraryModInt &p) const { return val != p.val; } ArbitraryModInt inverse() const { int a = val, b = get_mod(), u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b), swap(u -= t * v, v); } return ArbitraryModInt(u); } ArbitraryModInt pow(int64_t n) const { ArbitraryModInt ret(1), mul(val); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } }; template tuple get_factorial_data(int n) { static const int mod = mint::get_mod(); assert(0 <= n && n < mod); static vector fact = {1, 1}; static vector fact_inv = {1, 1}; static vector inv = {0, 1}; while (len(fact) <= n) { int k = len(fact); fact.eb(fact[k - 1] * mint(k)); auto q = ceil(mod, k); int r = k * q - mod; inv.eb(inv[r] * mint(q)); fact_inv.eb(fact_inv[k - 1] * inv[k]); } return {fact[n], fact_inv[n], inv[n]}; } template mint fact(int n) { static const int mod = mint::get_mod(); assert(0 <= n); if (n >= mod) return 0; return get<0>(get_factorial_data(n)); } template mint fact_inv(int n) { static const int mod = mint::get_mod(); assert(0 <= n && n < mod); return get<1>(get_factorial_data(n)); } template mint inv(int n) { static const int mod = mint::get_mod(); assert(0 <= n && n < mod); return get<2>(get_factorial_data(n)); } template mint C(ll n, ll k) { assert(n >= 0); if (k < 0 || n < k) return 0; if (!large) return fact(n) * fact_inv(k) * fact_inv(n - k); k = min(k, n - k); mint x(1); FOR(i, k) { x *= mint(n - i); } x *= fact_inv(k); return x; } template mint C_inv(ll n, ll k) { assert(n >= 0); assert(0 <= k && k <= n); if (!large) return fact_inv(n) * fact(k) * fact(n - k); return mint(1) / C(n, k); } using modint107 = modint<1000000007>; using modint998 = modint<998244353>; using amint = ArbitraryModInt; #line 2 "/home/maspy/compro/library/ds/lazysegtree.hpp" template struct LazySegTree { using Monoid_X = typename Lazy::X_structure; using Monoid_A = typename Lazy::A_structure; using X = typename Monoid_X::value_type; using A = typename Monoid_A::value_type; int n, log, size; vc dat; vc laz; LazySegTree() : LazySegTree(0) {} LazySegTree(int n) : LazySegTree(vc(n, Monoid_X::unit())) {} LazySegTree(vc v) : n(len(v)) { log = 1; while ((1 << log) < n) ++log; size = 1 << log; dat.assign(size << 1, Monoid_X::unit()); laz.assign(size, Monoid_A::unit()); FOR(i, n) dat[size + i] = v[i]; FOR3_R(i, 1, size) update(i); } void reset() { fill(all(dat), Monoid_X::unit()); fill(all(laz), Monoid_A::unit()); } void reset(const vc& v) { assert(len(v) == n); reset(); FOR(i, n) dat[size + i] = v[i]; FOR3_R(i, 1, size) update(i); } void update(int k) { dat[k] = Monoid_X::op(dat[2 * k], dat[2 * k + 1]); } void all_apply(int k, A a) { dat[k] = Lazy::act(dat[k], a); if (k < size) laz[k] = Monoid_A::op(laz[k], a); } void push(int k) { all_apply(2 * k, laz[k]); all_apply(2 * k + 1, laz[k]); laz[k] = Monoid_A::unit(); } void set(int p, X x) { assert(0 <= p && p < n); p += size; for (int i = log; i >= 1; i--) push(p >> i); dat[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } X get(int p) { assert(0 <= p && p < n); p += size; for (int i = log; i >= 1; i--) push(p >> i); return dat[p]; } vc get_all() { FOR(i, size) push(i); return {dat.begin() + size, dat.begin() + size + n}; } X prod(int l, int r) { assert(0 <= l && l <= r && r <= n); if (l == r) return Monoid_X::unit(); l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } X xl = Monoid_X::unit(), xr = Monoid_X::unit(); while (l < r) { if (l & 1) xl = Monoid_X::op(xl, dat[l++]); if (r & 1) xr = Monoid_X::op(dat[--r], xr); l >>= 1; r >>= 1; } return Monoid_X::op(xl, xr); } X prod_all() { return dat[1]; } void apply(int p, A a) { assert(0 <= p && p < n); p += size; dat[p] = Lazy::act(dat[p], a); for (int i = 1; i <= log; i++) update(p >> i); } void apply(int l, int r, A a) { assert(0 <= l && l <= r && r <= n); if (l == r) return; l += size; r += size; for (int i = log; i >= 1; i--) { if (((l >> i) << i) != l) push(l >> i); if (((r >> i) << i) != r) push((r - 1) >> i); } { int l2 = l, r2 = r; while (l < r) { if (l & 1) all_apply(l++, a); if (r & 1) all_apply(--r, a); l >>= 1; r >>= 1; } l = l2; r = r2; } for (int i = 1; i <= log; i++) { if (((l >> i) << i) != l) update(l >> i); if (((r >> i) << i) != r) update((r - 1) >> i); } } template int max_right(C& check, int l) { assert(0 <= l && l <= n); assert(check(Monoid_X::unit())); if (l == n) return n; l += size; for (int i = log; i >= 1; i--) push(l >> i); X sm = Monoid_X::unit(); do { while (l % 2 == 0) l >>= 1; if (!check(Monoid_X::op(sm, dat[l]))) { while (l < size) { push(l); l = (2 * l); if (check(Monoid_X::op(sm, dat[l]))) { sm = Monoid_X::op(sm, dat[l]); l++; } } return l - size; } sm = Monoid_X::op(sm, dat[l]); l++; } while ((l & -l) != l); return n; } template int min_left(C& check, int r) { assert(0 <= r && r <= n); assert(check(Monoid_X::unit())); if (r == 0) return 0; r += size; for (int i = log; i >= 1; i--) push((r - 1) >> i); X sm = Monoid_X::unit(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!check(Monoid_X::op(dat[r], sm))) { while (r < size) { push(r); r = (2 * r + 1); if (check(Monoid_X::op(dat[r], sm))) { sm = Monoid_X::op(dat[r], sm); r--; } } return r + 1 - size; } sm = Monoid_X::op(dat[r], sm); } while ((r & -r) != r); return 0; } void debug() { print("lazysegtree getall:", get_all()); } }; #line 2 "/home/maspy/compro/library/alg/lazy_powersums_set.hpp" #line 1 "/home/maspy/compro/library/alg/monoid_set.hpp" template struct Monoid_Set { using value_type = E; using X = value_type; static X op(X x, X y) { return (y == none_val ? x : y); } static constexpr X unit() { return none_val; } static constexpr bool commute = false; }; #line 2 "/home/maspy/compro/library/alg/group_power_sums.hpp" // 0 乗和から K-1 乗和まで template struct Group_power_sums { using value_type = vc; using X = value_type; static X op(X x, X y) { vc z(K); FOR(i, K) z[i] = x[i] + y[i]; return z; } static X unit() { return vc(K, mint(0)); } static constexpr bool commute = 1; }; #line 5 "/home/maspy/compro/library/alg/lazy_powersums_set.hpp" template struct Lazy_Power_Sums_Set { using MX = Group_power_sums; using MA = Monoid_Set; using X_structure = MX; using A_structure = MA; using X = typename MX::value_type; using A = typename MA::value_type; static X act(const X &x, const A &b) { if (b == -1) return x; mint a = b; vc y(K); vc pow(K); pow[0] = mint(1); FOR(k, K - 1) pow[k + 1] = pow[k] * a; FOR(i, 5) y[i] = x[0] * pow[i]; return y; } }; #line 6 "main.cpp" using mint = modint998; void solve() { LL(N); using Mono = Group_power_sums; VEC(mint, A, N); vv(mint, seg_raw, N, 5); FOR(i, N) { mint a = A[i]; seg_raw[i] = {1, a, a * a, a * a * a, a * a * a * a}; } LazySegTree> seg(seg_raw); LL(Q); FOR(Q) { LL(t, u, v, w); if (u > v) swap(u, v); if (w < u || v < w) swap(u, v); --u, --v; if (t == 0) { LL(b); if (u < v) { seg.apply(u, v + 1, b); } else { seg.apply(0, v + 1, b); seg.apply(u, N, b); } } else { vc e; if (u < v) { e = seg.prod(u, v + 1); } else { e = Mono::op(seg.prod(0, v + 1), seg.prod(u, N)); } // print(e); mint n = e[0]; mint mu = -e[1] / n; ll k = t; // sum (x+mu)^k mint ans = 0; FOR(i, k + 1) { ans += e[i] * mu.pow(k - i) * C(k, i); } ans /= n; print(ans); } } } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << setprecision(15); ll T = 1; // LL(T); FOR(T) solve(); return 0; }