#include<bits/stdc++.h>
using namespace std;
#define overload4(a, b, c, d, name, ...) name
#define REP0(n) for(long long _abcde12345 = 0; _abcde12345 < (long long)(n); ++_abcde12345)
#define REP1(i, n) for(long long i = 0; i < (long long)(n); ++i)
#define REP2(i, a, b) for(long long i = (a); i < (long long)(b); ++i)
#define REP3(i, a, b, c) for(long long i = (a); i < (long long)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define rrep(i, a, b) for(long long i = (a); i >= (long long)(b); --i)
#define each_for(...) for (auto&& __VA_ARGS__)
#define each_const(...) for (const auto& __VA_ARGS__)
#define drop(x) { cout << (x) << endl; return; }
template<class T,class S>inline bool chmax(T& a,const S& b){return (a < b ? a = b, 1 : 0);}
template<class T,class S>inline bool chmin(T& a,const S& b){return (a > b ? a = b, 1 : 0);}
/************************************************************************************************/

void solve();

int main()
{
	cin.tie(nullptr)->sync_with_stdio(false);
	cout<<fixed<<setprecision(15);

	int T=1;

	//cin>>T;
	
	rep(T)solve();

	return 0;
}

/////////////////////////////////////////////////////////////

#include<atcoder/fenwicktree>

int N,B,Q;
int X[1<<17],Y[1<<17],Z[1<<17];
atcoder::fenwick_tree<int>BIT(1<<17);

void solve()
{
	cin>>N>>B>>Q;
	X[0]=Y[0]=Z[0]=1;
	for(int i=1;i<=N;++i)
	{
		X[i]=(X[i-1]+1)%B;
		Y[i]=(3*Y[i-1]+2*X[i]*Z[i-1])%B;
		Z[i]=(3*Z[i-1])%B;
	}
	while(Q--)
	{
		int L,M,R;cin>>L>>M>>R;
		L--;
		BIT.add(L,1);
		BIT.add(R,-1);
		int i=BIT.sum(0,M);
		cout<<X[i]<<' '<<Y[i]<<' '<<Z[i]<<endl;
	}
}