#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 100005;
int n, m, p, a[N], tree[4*N], t_ja[4*N], t_ch[4*N];

void pushdown(int node, int start, int end){
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  tree[left_node] = (tree[left_node] * t_ch[node] + t_ja[node] * (mid - start + 1)) % p;
  tree[right_node] = (tree[right_node] * t_ch[node] + t_ja[node] * (end - mid)) % p;
  t_ch[left_node] = (t_ch[left_node] * t_ch[node]) % p;
  t_ch[right_node] = (t_ch[right_node] * t_ch[node]) % p;
  t_ja[left_node] = (t_ja[left_node] * t_ch[node] + t_ja[node]) % p;
  t_ja[right_node] = (t_ja[right_node] * t_ch[node] + t_ja[node]) % p;
  t_ch[node] = 1;
  t_ja[node] = 0;
}

void update_tree2(int node, int start, int end, int x, int y, int k){
  if(start > y || end < x){
    return ;
  }
  if(start >= x && end <= y){
    tree[node] = (tree[node] + (end - start + 1) * k) % p;
    t_ja[node] = (t_ja[node] + k) % p;
    return ;
  }
  pushdown(node, start, end);
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  update_tree2(left_node, start, mid, x, y, k);
  update_tree2(right_node, mid + 1, end, x, y, k);
  tree[node] = (tree[left_node] + tree[right_node]) % p;
}


void update_tree1(int node, int start, int end, int x, int y, int k){
  if(start > y || end < x){
    return ;
  }
  if(start >= x && end <= y){
    tree[node] = (tree[node] * k) % p;
    t_ch[node] = (t_ch[node] * k) % p;
    t_ja[node] = (t_ja[node] * k) % p;
    return ;
  }
  pushdown(node, start, end);
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  update_tree1(left_node, start, mid, x, y, k);
  update_tree1(right_node, mid + 1, end, x, y, k);
  tree[node] = (tree[left_node] + tree[right_node]) % p;
}

void build_tree(int node, int start, int end){
  t_ch[node] = 1;
  if(start == end){
    tree[node] = a[start];
    return ;
  }
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  build_tree(left_node, start, mid);
  build_tree(right_node, mid + 1, end);
  tree[node] = tree[left_node] + tree[right_node];
  tree[node] %= p;
}

int query(int node, int start, int end, int L, int R){
  if(start > R || end < L){
    return 0;
  }
  if(L <= start && end <= R){
    tree[node];
  }
  pushdown(node, start, end);
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  return (query(left_node, start, mid, L, R) + query(right_node, mid + 1, end, L, R))%p;
}

signed main(){
  fill(t_ch, t_ch + 4 * N, 1);
  cin >> n >> m >> p;
  for(int i = 1;i <= n;i++){
    cin >> a[i];
  }
  build_tree(1, 1, n);
  for(int i = 1;i <= m;i++){
    int x, y, k, op;
    cin >> op;
    if(op == 1){
      cin >> x >> y >> k;
      update_tree1(1, 1, n, x, y, k);
    }
    if(op == 2){
      cin >> x >> y >> k;
      update_tree2(1, 1, n, x, y, k);
    }
    if(op == 3) {
      cin >> x >> y;
      cout << query(1, 1, n, x, y) % p << endl;
    }
  }
  return 0;
}