#include <cstdio>
using namespace std;
const long long mod = 1e9 + 7;
long long C[15][15];
void init() {
    C[0][0] = 1;
    for (int i = 1; i <= 10; i++) {
        C[i][0] = 1;
        for (int j = 1; j <= i; j++) {
            C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
        }
    }
}
struct segmenttree {
    long long a[100010];
    struct node {
        long long val[12] = {};
        long long lazyadd = 0, lazyset = 0;
        bool lazy = false;
    } nodes[400010];
    void pushaddtag(int p, int l, int r, long long x) {
        if (x == 0) return;
        for (int i = 10; i >= 0; i--) {
            long long now = 1;
            for (int j = 1; j <= i; j++) {
                now = now * x % mod;
                nodes[p].val[i] = (nodes[p].val[i] + C[i][j] * now * nodes[p].val[i - j]) % mod;
            }
        }
        nodes[p].lazyadd = (nodes[p].lazyadd + x) % mod;
    }
    void pushsettag(int p, int l, int r, long long x) {
        long long now = 1;
        for (int i = 0; i <= 10; i++) {
            nodes[p].val[i] = now * (r - l + 1) % mod;
            now = now * x % mod;
        }
        nodes[p].lazyset = x;
        nodes[p].lazy = true;
        nodes[p].lazyadd = 0;
    }
    void pushup(int p) {
        for (int i = 0; i <= 10; i++) {
            nodes[p].val[i] = nodes[p << 1].val[i] + nodes[p << 1 | 1].val[i];
        }
    }
    void pushdown(int p, int l, int r) {
        // printf("pushdown %d [%d, %d] : %lld %lld\n", p, l, r, nodes[p].lazyadd, nodes[p].lazyset);
        int mid = (l + r) >> 1;
        if (nodes[p].lazy) {
            pushsettag(p << 1, l, mid, nodes[p].lazyset);
            pushsettag(p << 1 | 1, mid + 1, r, nodes[p].lazyset);
            nodes[p].lazyset = 0;
            nodes[p].lazy = false;
        }
        if (nodes[p].lazyadd) {
            pushaddtag(p << 1, l, mid, nodes[p].lazyadd);
            pushaddtag(p << 1 | 1, mid + 1, r, nodes[p].lazyadd);
            nodes[p].lazyadd = 0;
        }
    }
    void build(int p, int l, int r) {
        nodes[p].lazyadd = nodes[p].lazyset = 0;
        nodes[p].lazy = false;
        if (l == r) {
            nodes[p].val[0] = 1;
            for (int i = 1; i <= 10; i++) {
                nodes[p].val[i] = nodes[p].val[i - 1] * a[l] % mod;
            }
            return;
        }
        int mid = (l + r) >> 1;
        build(p << 1, l, mid);
        build(p << 1 | 1, mid + 1, r);
        pushup(p);
    }
    void modifyadd(int p, int l, int r, int L, int R, long long x) {
        if (L <= l && r <= R) {
            pushaddtag(p, l, r, x);
            return;
        }
        pushdown(p, l, r);
        int mid = (l + r) >> 1;
        if (L <= mid) {
            modifyadd(p << 1, l, mid, L, R, x);
        }
        if (R > mid) {
            modifyadd(p << 1 | 1, mid + 1, r, L, R, x);
        }
        pushup(p);
    }
    void modifyset(int p, int l, int r, int L, int R, long long x) {
        if (L <= l && r <= R) {
            pushsettag(p, l, r, x);
            return;
        }
        pushdown(p, l, r);
        int mid = (l + r) >> 1;
        if (L <= mid) {
            modifyset(p << 1, l, mid, L, R, x);
        }
        if (R > mid) {
            modifyset(p << 1 | 1, mid + 1, r, L, R, x);
        }
        pushup(p);
    }
    long long query(int p, int l, int r, int L, int R, long long x) {
        if (L <= l && r <= R) {
            return nodes[p].val[x];
        }
        pushdown(p, l, r);
        int mid = (l + r) >> 1;
        long long ans = 0;
        if (L <= mid) {
            ans += query(p << 1, l, mid, L, R, x);
        }
        if (R > mid) {
            ans += query(p << 1 | 1, mid + 1, r, L, R, x);
        }
        return (ans % mod + mod) % mod;
    }
    void print(int p, int l, int r, int option = 10) {
        printf("%d [%d, %d] [%lld, %lld] : ", p, l, r, nodes[p].lazyadd, nodes[p].lazyset);
        for (int i = 0; i <= option; i++) {
            printf("%lld ", nodes[p].val[i]);
        }
        printf("\n");
        if (l == r) return;
        int mid = (l + r) >> 1;
        print(p << 1, l, mid, option);
        print(p << 1 | 1, mid + 1, r, option);
    }
} sgt;
int n, m, opt, l, r;
long long x;
int main() {
    init();
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%lld", &sgt.a[i]);
    }
    sgt.build(1, 1, n);
    // sgt.print(1, 1, n);
    // printf("\n");
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%d%lld", &opt, &l, &r, &x);
        if (opt == 1) {
            sgt.modifyadd(1, 1, n, l, r, x);
        } else if (opt == 2) {
            sgt.modifyset(1, 1, n, l, r, x);
        } else {
            printf("%lld\n", sgt.query(1, 1, n, l, r, x));
        }
        // sgt.print(1, 1, n);
        // printf("\n");
    }
    return 0;
}