#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001
long long B;
using P = pair<long long,vector<long long>>;
vector<long long> ps;
P op(P a,P b){
	a.first *= b.first;
	a.first %= B;
	rep(i,a.second.size())a.second[i] += b.second[i];
	return a;
}

P e(){
	return make_pair(1LL,vector<long long>(ps.size()+1,0));
}


int main(){
	int n,q;
	cin>>n>>B>>q;
	vector<int> c;
	{
		long long b = B;
		for(long long i=2;i*i<=b;i++){
			if(b%i==0){
				ps.push_back(i);
				c.push_back(0);
				while(b%i==0){
					b/=i;
					c.back()++;
				}
			}
		}
		
		if(b!=1){
			ps.push_back(b);
			c.push_back(1);
		}
	}
	
	vector<P> a(n,e());
	rep(i,n){
		long long t;
		cin>>t;
		rep(j,ps.size()){
			while(t!=0 && t%ps[j]==0){
				t /= ps[j];
				a[i].second[j]++;
			}
		}
		if(t!=0){
			a[i].first = t%B;
		}
		else{
			a[i].first = 1;
			a[i].second.back() = 1;
		}
	}
	segtree<P,op,e> seg(a);
	rep(_,q){
		long long x,y,z,w;
		cin>>x>>y>>z>>w;
		auto t = seg.get(x);
		bool f = false;
		if(y==B){
			f = true;
			if(t.second.back()>0){
			}
			else{
				rep(i,ps.size()){
					if(c[i]>t.second[i])f = false;
				}
			}
		}
		if(f){
			if(t.second.back()>0){
			}
			else{
				rep(i,ps.size())t.second[i] -= c[i];
			}
		}
		else{
			if(y==0){
				t = e();
				t.second.back() = 1;
				t.first = 1;
			}
			else{
				rep(i,ps.size()){
					while(y!=0 && y%ps[i]==0){
						y /=ps[i];
						t.second[i]++;
					}
				}
				if(y==0)t.second.back()++;
				else{
					y %= B;
					t.first *= y;
					t.first %= B;
				}
			}
		}
		seg.set(x,t);
		t = seg.prod(z,w+1);
		long long ans = t.first;
		rep(i,ps.size()){
			ans *= pow_mod(ps[i],t.second[i],B);
			ans %= B;
		}
		if(t.second.back()!=0)ans = 0;
		cout<<ans<<endl;
	}
	
	return 0;
}