#include <bits/stdc++.h>
using namespace std;
typedef long long i64; 
const int N = 6e5 + 5;
inline int read(void) {
    int x = 0, c = getchar(); 
    while (!isdigit(c)) c = getchar(); 
    while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); 
    return x; 
}
int n, M, A[N]; 
struct Node {
    int x, A, B; 
    Node(int x = 0, int A = 0, int B = 0) : x(x), A(A), B(B) {}
};
vector<Node> T[N * 4]; 
int a, b, c, d; 
void add(int o, int l, int r, int x) {
    if (l == r) {
        if (a != 1) T[o].emplace_back(a - 1, 1, 0); 
        T[o].emplace_back(b, c, d); 
        if (b != n) T[o].emplace_back(n, 1, 0); 
        return; 
    }
    int mid = l + r >> 1; 
    if (x <= mid) add(o << 1, l, mid, x); 
    else add(o << 1 | 1, mid + 1, r, x); 
    if (x != r) return; 

    for (int lp = 0, rp = 0; lp < T[o << 1].size() && rp < T[o << 1 | 1].size(); ) {
        Node L = T[o << 1][lp], R = T[o << 1 | 1][rp];
        T[o].emplace_back(min(L.x, R.x), 1ll * L.A * R.A % M, (1ll * L.B * R.A + R.B) % M); 
        if (L.x == R.x) ++lp, ++rp; 
        else if (L.x < R.x) ++lp;  
        else ++rp; 
    }
}
int id, ans;
inline void get(int o) {
    int l = -1, r = T[o].size(); 
    while (l + 1 != r) {
        int mid = l + r >> 1;
        if (T[o][mid].x >= id) r = mid; 
        else l = mid; 
    }
    ans = (1ll * ans * T[o][r].A + T[o][r].B) % M;
}
void ask(int o, int l, int r, int x, int y) {
    if (x <= l && r <= y) return get(o); 
    int mid = l + r >> 1; 
    if (x <= mid) ask(o << 1, l, mid, x, y); 
    if (mid < y) ask(o << 1 | 1, mid + 1, r, x, y); 
}
int main(void) {
    int type = read() & 1; 
    n = read(), M = read();
    for (int i = 1; i <= n; ++i) A[i] = read(); 
    int q = read(), tt = 0; 
    for (int i = 1; i <= q; ++i) {
        int op = read();
        if (op == 1) {
            a = read() ^ ans, b = read() ^ ans, c = read(), d = read(); 
            add(1, 1, q, ++tt); 
        } else {
            int l = read() ^ ans, r = read() ^ ans; id = read() ^ ans; 
            ans = A[id]; ask(1, 1, q, l, r); 
            printf("%d\n", ans); ans = type ? ans : 0; 
        }
    }
    return 0;
}