#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

int lz[1 << 19], C[N][25];

struct op
{
    int z[20];
} t[1 << 19];

op operator + (op x, op y)
{
    op z;
    for (int i = 0; i < 20; ++i) {
        z.z[i] = 0;
        for (int j = 0; j <= i; ++j) {
            z.z[i] = (z.z[i] + 1ll * x.z[j] * y.z[i - j]) & 1048575;
        }
    }
    return z;
}

op delta(op e, int v, int len)
{
    if (!v) {
        return e;
    }
    op z;
    for (int i = 0; i < 20; ++i) {
        z.z[i] = 0;
        for (int j = 0, now = 1; j <= i; ++j, now = 1ll * now * v & 1048575) {
            if (i - j <= len) {
                z.z[i] = (z.z[i] + ((1ll * now * e.z[i - j]) & 1048575) * C[len - (i - j)][j]) & 1048575;
            }
        }
    }
    return z;
}

void modify(int k, int l, int r, int x, int y, int v)
{
    if (l > y || r < x) {
        return;
    }
    if (l >= x && r <= y) {
        lz[k] += v;
        lz[k] &= 1048575;
        t[k] = delta(t[k], v, r - l + 1);
        return;
    }
    int mid = (l + r) >> 1;
    modify(k << 1, l, mid, x, y, v);
    modify(k << 1 | 1, mid + 1, r, x, y, v);
    t[k] = delta(t[k << 1] + t[k << 1 | 1], lz[k], r - l + 1);
    return;
}

op query(int k, int l, int r, int x, int y)
{
    if (l >= x && r <= y) {
        return t[k];
    }
    int mid = (l + r) >> 1;
    if (mid >= y) {
        return delta(query(k << 1, l, mid, x, y), lz[k], min(r, y) - max(l, x) + 1);
    }
    if (mid < x) {
        return delta(query(k << 1 | 1, mid + 1, r, x, y), lz[k], min(r, y) - max(l, x) + 1);
    }
    return delta(query(k << 1, l, mid, x, y) + query(k << 1 | 1, mid + 1, r, x, y), lz[k], min(r, y) - max(l, x) + 1);
}

signed main()
{
    C[0][0] = 1;
    for (int i = 1; i < N; ++i) {
        C[i][0] = 1;
        for (int j = 1; j <= 22; ++j) {
            C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
            C[i][j] &= 1048575;
        }
    }
    int n, q;
    scanf("%d%d", &n, &q);
    for (int i = 1; i < 1 << 19; ++i) {
        t[i].z[0] = 1;
    }
    for (int i = 1, x; i <= n; ++i) {
        scanf("%d", &x);
        modify(1, 1, n, i, i, x - 1);
    }
    while (q--) {
        int opt, l, r, x;
        scanf("%d%d%d", &opt, &l, &r);
        if (opt == 1) {
            scanf("%d", &x);
            modify(1, 1, n, l, r, x);
        } else {
            op res = query(1, 1, n, l, r);
            int A = 0;
            for (int i = 0; i < 20; ++i) {
                A += res.z[i];
            }
            printf("%d\n", A & 1048575);
        }
    }
    return 0;
}