#include <cstdio>
#include <iostream>

using namespace std;

const int N = 5145;

int n;
int m;
long long nums[N];
long long tree[N];

int lowbit (int id) {
    return id & (-id);
}

void add (int id, long long num) {
    for (; id < N; id += lowbit (id)) {
        tree[id] += num;
    }
}

long long query (int id) {
    long long ans = 0;
    for (; id; id -= lowbit (id)) {
        ans += tree[id];
    }
    return ans;
}

long long power_quick (long long a, long long n, long long p) {
    long long ans = 1;
    a %= p;
    while (n) {
        if (n & 1) {
            ans = ans * a % p;
        }
        a = a * a % p;
        n >>= 1;
    }
    return ans;
}

int main () {
    
    freopen ("sjjgt.in", "r", stdin);
    freopen ("sjjgt.out", "w", stdout);
    
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> nums[i];
        add (i, nums[i] - nums[i - 1]);
    }
    int opt;
    int l;
    int r;
    long long x;
    for (int i = 1; i <= m; i++) {
        cin >> opt >> l >> r >> x;
        if (opt == 1) {
            add (l, x);
            add (r + 1, -x);
        }
        else {
            long long a = query (l);
            long long b = query (r);
            cout << power_quick (a, b, x) << endl;
        }
    }
    
    return 0;
}