#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint mint;

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}
template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}


// [ DUAL SEGMENT TREE ] BY SHOBON
// REFERENCE --- ATCODER LIBRARY
// VERSION 1.0 (2022/08/28)

int ceil_pow2(int n) {
	int x = 0;
	while ((1U << x) < (unsigned int)(n)) x++;
	return x;
}

template <class F, F (*composition)(F, F), F (*id)()> struct dual_segtree{
		public:
			dual_segtree() : dual_segtree(0) {}
			explicit dual_segtree(int n) : dual_segtree(std::vector<F>(n, id())) {}
			explicit dual_segtree(const std::vector<F>& v) : _n(int(v.size())) {
				log = ceil_pow2(_n);
				size = 1 << log;
				lz = std::vector<F>(2 * size, id());
				for (int i = 0; i < _n; i++) lz[size + i] = v[i];
			}
 
			void apply(int l, int r, F f){
				assert (0 <= l && l <= r && r <= _n);
				if (l == r) return;
 
				l += size;
				r += size;
 
				for (int i = log; i >= 1; i--){
					if (((l >> i) << i) != l) push(l >> i);
					if (((r >> i) << i) != r) push((r - 1) >> i);
				}
 
				while (l < r){
					if (l & 1) all_apply(l++, f);
					if (r & 1) all_apply(--r, f);
					l >>= 1;
					r >>= 1;
				}
			}
			
			F get(int p) {
				assert(0 <= p && p < _n);
				p += size;
				for (int i = log; i >= 1; i--) push(p >> i);
				return lz[p];
			}
		
		private:
			int _n, size, log;
			std::vector<F> lz;
 
			void all_apply(int k, F f){
				lz[k] = composition(f, lz[k]);
			}
 
			void push(int k){
				all_apply(2 * k, lz[k]);
				all_apply(2 * k + 1, lz[k]);
				lz[k] = id();
			}
 
};

// ---- END : DUAL SEGMENT TREE ----

struct F{
	mint v[3];
};

int composition(int a, int b){
	return a + b;
}

int id(){
	return 0;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, b, q; cin >> n >> b >> q;
	mint::set_mod(b);


	dual_segtree<int,composition,id> seg(n);

	vector<F> tr(q+1);
	tr[0] = {1, 1, 1};
	rep(i,1,q+1){
		tr[i].v[0] = tr[i-1].v[0] + 1;
		tr[i].v[1] = (tr[i-1].v[0] + 1) * tr[i-1].v[2] * 2 + tr[i-1].v[1] * 3;
		tr[i].v[2] = tr[i-1].v[2] * 3;
	}

	rep(i,0,q){
		int l, m, r; cin >> l >> m >> r;
		l--;
		m--;
		seg.apply(l, r, 1);
		//cout << seg.get(m) << endl;
		F s = tr[seg.get(m)];
		cout << s.v[0].val() << " " << s.v[1].val() << " " << s.v[2].val() << "\n";
	}
	
}