#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vvi; typedef vector vvvi; typedef vector vvvvi; typedef pair pi; typedef pair ppi; typedef pair pppi; typedef pair ppppi; #define FOR(i,l,r) for(ll i=l;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()) templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint&a){os<>N>>B>>Q;mod=B; ll d=2; vectorD; 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; segtreeS(N); vector>F(M,fenwick_tree(N)); REP(i,N){ if(!A[i]){ S.set(i,0);continue; } 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<