#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#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) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
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;}
/*
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;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
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,0,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;}
ll mod;
ll op(ll a,ll b){return a%mod*(b%mod)%mod;}
ll e(){return 1;}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	ll N,B,Q;cin>>N>>B>>Q;
	mod=B;
	ll d=2;
	vector<pl>D;
	while(d*d<=B){
		ll e=0;
		while(B%d==0)e++,B/=d;
		if(e)D.emplace_back(d,e);
		d++;
	}
	if(B>1)D.emplace_back(B,1);
  ll M=sz(D);
	vl A(N);cin>>A;
  segtree<ll,op,e>S(N);
  vector<fenwick_tree<ll>>F(M,fenwick_tree<ll>(N));
	rep(i,0,N){
		if(!A[i]){rep(j,0,M)F[j].add(i,1e16);continue;}
		rep(j,0,M){
			ll p=D[j].F;
			while(A[i]%p==0)A[i]/=p,F[j].add(i,1);
		}
		S.set(i,A[i]%mod);
	}
	while(Q--){
		ll j,m,l,r;cin>>j>>m>>l>>r;r++;
		if(!m)A[j]=0,S.set(j,0);
		else if(m==mod){
			bool ok=1;
			rep(i,0,M)if(D[i].S>F[i].sum(j,j+1))ok=0;
			if(ok)rep(i,0,M)F[i].add(j,-D[i].S);
			else rep(i,0,M)F[i].add(j,D[i].S);
		}
	  else rep(i,0,M){
			ll p=D[i].F;
			while(m%p==0)F[i].add(j,1),m/=p;
			A[j]*=m%mod;
			A[j]%=mod;
			S.set(j,A[j]);
		}
	  ll x=S.prod(l,r)%mod;
	  rep(i,0,M)x=x*pow_mod(D[i].F,F[i].sum(l,r),mod)%mod;
	  cout<<x<<endl;
	}
	return 0;
}