#include <bits/stdc++.h>
using namespace std; 
typedef unsigned int uint; 
const uint P = (1 << 20); 
const int N = 2e5 + 5; 

struct Node {
    uint c[21]; 
    friend Node operator+ (const Node &a, const Node &b) {
        Node c; memset(c.c, 0, sizeof c.c); 
        for (int i = 0; i <= 20; ++i)
            for (int j = 0; i + j <= 20; ++j)
                c.c[i + j] += a.c[i] * b.c[j]; 
        return c; 
    }
} A[N * 4]; 

int n, q; 
uint a[N], tag[N * 4]; 

void build(int o, int l, int r) {
    if (l == r) {
        A[o].c[0] = 1; // A[o].c[1] = 1; 
        return; 
    }
    // 选择 0 个偶数
    int mid = l + r >> 1; build(o << 1, l, mid); build(o << 1 | 1, mid + 1, r); 
    A[o] = A[o << 1] + A[o << 1 | 1]; 
    // for (int i = 0; i < 20; ++i) cout << T[o].c[i] << " \n"[i == 20]; 
}
uint tmp[25], C[200005][22]; 
inline void maketag(int o, int l, int r, int k) {
    tag[o] += k; 
    for (int i = tmp[0] = 1; i <= 20; ++i) tmp[i] = tmp[i - 1] * k; 

    for (int i = min(r - l + 1, 20); i; --i)
        for (int j = 0; j < i; ++j)
            A[o].c[i] += A[o].c[j] * tmp[i - j] * C[r - l + 1 - j][i - j]; 
}
inline void pushdown(int o, int l, int r) {
    if (!tag[o]) return; int mid = l + r >> 1; 
    maketag(o << 1, l, mid, tag[o]); 
    maketag(o << 1 | 1, mid + 1, r, tag[o]); 
    tag[o] = 0;  
}
void update(int o, int l, int r, int x, int y, int k) {
    if (x <= l && r <= y) return maketag(o, l, r, k); 
    pushdown(o, l, r); int mid = l + r >> 1; 
    if (x <= mid) update(o << 1, l, mid, x, y, k); 
    if (mid < y) update(o << 1 | 1, mid + 1, r, x, y, k); 
    A[o] = A[o << 1] + A[o << 1 | 1]; 
}
Node query(int o, int l, int r, int x, int y) {
    if (x <= l && r <= y) return A[o];
    pushdown(o, l, r); int mid = l + r >> 1; 
    if (y <= mid) return query(o << 1, l, mid, x, y); 
    if (mid < x) return query(o << 1 | 1, mid + 1, r, x, y); 
    return query(o << 1, l, mid, x, y) + query(o << 1 | 1, mid + 1, r, x, y); 
}

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> q; 
    for (int i = 0; i <= n; ++i)
		for (int j = C[i][0] = 1; j <= min(i, 20); ++j)
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % P; 
    build(1, 1, n); 
    for (int i = 1; i <= n; ++i) cin >> a[i], update(1, 1, n, i, i, a[i] - 1); 
    while (q--) {
        int op, l, r, x; cin >> op >> l >> r; 
        if (op == 1) cin >> x, update(1, 1, n, l, r, x); 
        else {
            Node t = query(1, 1, n, l, r); 
            uint ans = 0; 
            for (int i = 0; i <= 20; ++i) ans += t.c[i]; 
            // for (int i = 0; i <= 20; ++i) cout << t.c[i] << " \n"[i == 20]; 
            cout << ans % P << '\n'; 
        }
    }
    return 0;
}