#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <queue>
#define ll long long
#define db double
using namespace std;
const ll N = 1e5 + 100;
ll tt,tr[N],n,md,q;
struct answer{
	ll x,y,z;
	void prt() {
		printf("%lld %lld %lld\n",x,y,z);
	}
}ans[N];
ll lwb(ll p) {
	return (p & (-p));
}
void add(ll p,ll k) {
	while(p <= n) {
		tr[p] += k;
		p += lwb(p);
	}
}
ll sum(ll p) {
	ll res = 0;
	while(p > 0) {
		res += tr[p];
		p -= lwb(p);
	}
	return res;
}
void solve() {
	scanf("%lld%lld%lld",&n,&md,&q);
	ans[0].x = ans[0].y = ans[0].z = (1 % md);
	for (ll i = 1;i <= q;i++) {
		ans[i] = ans[i - 1];
		ans[i].x = (ans[i].x + 1) % md;
		ans[i].y = (3 * ans[i].y + ans[i].x * ans[i].z * 2) % md;
		ans[i].z = (3 * ans[i].z) % md;
	}
	memset(tr,0,sizeof(tr));
	for (ll i = 1;i <= q;i++) {
		ll l,m,r;
		scanf("%lld%lld%lld",&l,&m,&r);
		add(l,1);
		add(r + 1,-1);
		ans[sum(m)].prt();
	}
}
int main() {
	tt = 1;
	while(tt) {
		solve();
		tt--;
	}
	return 0;
}