#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
/*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
//*/

ll mod;
ll op(ll a,ll b){return a*b%mod;}
ll e(){return 1;}
int main(){
  ll N,B,Q;cin>>N>>B>>Q;mod=B;
  ll d=2;
  vector<pi>D;
  while(d*d<=B){
      ll e=0;
      while(B%d==0){e++;B/=d;}
      if(e)D.emplace_back(pi(d,e));
      d++;
  }
  if(B>1)D.emplace_back(pi(B,1));
  ll M=sz(D);
  vi A(N);cin>>A;
  segtree<ll,op,e>S(N);
  vector<fenwick_tree<ll>>F(M,fenwick_tree<ll>(N));
  REP(i,N)if(A[i]){
      REP(j,M){
          ll p=D[j].F;
          while(A[i]%p==0){
              A[i]/=p;
              F[j].add(i,1);
          }
      }
      S.set(i,A[i]);
  }
  while(Q--){
      ll j,m,l,r;cin>>j>>m>>l>>r;
      if(m==0)A[j]=0;
      if(A[j]){
          bool c=1;
          if(m==mod){
              bool ok=1;
              REP(i,M)if(D[i].S>F[i].sum(j,j+1))ok=0;
              if(ok){c=0;REP(i,M)F[i].add(j,-D[i].S);}
          }
          if(c){
              REP(i,M){
                ll p=D[i].F;
                while(m%p==0){F[i].add(j,1);m/=p;}
              }
              A[j]*=m;A[j]%=mod;
              S.set(j,A[j]);
          }
      }
      ll x=S.prod(l,r+1)%mod;
      REP(i,M)x=x*pow_mod(D[i].F,F[i].sum(l,r+1),mod)%mod;
      cout<<x<<endl;
  }
  return 0;
}