#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int mo;
int N,Q;
ll A[10101];
int la[10101];
int L[10101],M[10101],R[10101];
ll C[10101],D[10101];
ll modpow(ll a, ll n = mo-2) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>mo>>Q;
	MINUS(la);
	FOR(i,Q) {
		cin>>L[i]>>M[i]>>R[i]>>C[i]>>D[i];
		C[i]%=mo;
		L[i]--,M[i]--;
		la[M[i]]=i;
	}
	FOR(x,Q) {
		for(i=L[x];i<R[x];i++) if(x<=la[i]) {
			A[i]=(A[i]+modpow(i+1+C[x],D[x]))%mo;
			if(i==M[x]) cout<<A[i]<<endl;
		}
		
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}