#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;}
int B;
ll op(ll a,ll b){return a*b%B;}
ll e(){return 1%B;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int N,Q;cin>>N>>B>>Q;
  vl A(N);cin>>A;
  int d=2,_B=B;
  vector<pl>F;
  while(d*d<=B){
    int e=0;
    while(B%d==0)B/=d,e++;
    F.emplace_back(d,e);
    d++;
  }
  if(B>1)F.emplace_back(B,1);
  B=_B;
  segtree<ll,op,e>seg(N);
  rep(i,0,N)seg.set(i,A[i]%B);
  vector<vector<int>>E(N,vector<int>(sz(F)));
  rep(i,0,N)if(A[i])rep(j,0,sz(F))while(A[i]%F[j].F==0)A[i]/=F[j].F,E[i][j]++;
  while(Q--){
    ll j,m,l,r;cin>>j>>m>>l>>r;r++;
    if(A[j]){
      bool ok=1;
      rep(i,0,sz(F))if(E[j][i]<F[i].S)ok=0;
      if(ok&&m==B){
        ll pr=A[j];
        rep(i,0,sz(F))E[j][i]-=F[i].S,pr*=pow_mod(F[i].F,E[j][i],B),pr%=B;
        seg.set(j,pr);
      }
      else if(!m){
        A[j]=0;
        seg.set(j,0);
        rep(i,0,sz(F))E[j][i]=0;
      }
      else{
        seg.set(j,seg.get(j)*(m%B)%B);
        rep(i,0,sz(F))while(m%F[i].F==0)m/=F[i].F,E[j][i]++;
        A[j]=(m%B)*A[j]%B;
      }
    }
    cout<<seg.prod(l,r)<<endl;
  }
  return 0;
}