#include #include // url #define rep(i,a,b) for(int i=a;i=a;i--) #define all(x) (x).begin(),(x).end() #define pb(x) push_back(x); templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b=0.0)return (M_PI/2); else return (M_PI/2+M_PI); } else if(abs(y)<=eps){ if(x>=0.0)return 0.0; else return M_PI; } res=atan2(abs(y),abs(x)); if(x<=0&&y>=0)res=(M_PI-res); else if(x<=0&&y<=0)res+=(M_PI); else if(x>=0&&y<=0)res=(M_PI*2-res); return res; } ll gcd(ll a,ll b){ if(a==0||b==0)return a+b; ll r; r=a%b; if(r==0){ return b; } else{ return gcd(b,r); } } std::ostream &operator<<(std::ostream &dest, __int128_t value) { std::ostream::sentry s(dest); if (s) { __uint128_t tmp = value < 0 ? -value : value; char buffer[128]; char *d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } __int128 parse128(string &s) { __int128 ret = 0; for (int i = 0; i < s.length(); i++){ if ('0' <= s[i] && s[i] <= '9'){ ret = 10 * ret + s[i] - '0'; } } return ret; } using l3 = __int128; typedef pair P; ll mod; struct S{ long long value; int size; }; using F = long long; S op(S a, S b){ return {a.value+b.value, a.size+b.size}; } S e(){ return {0, 0}; } S mapping(F f, S x){ return {x.value + f*x.size, x.size}; } F composition(F f, F g){ return (f+g); } F id(){ return 0; } int main(void){ ios::sync_with_stdio(false); cin.tie(nullptr); int N,B,Q;cin >> N >> B >> Q; mod=B; ll x[Q+1],y[Q+1],z[Q+1]; x[0]=1;y[0]=1;z[0]=1; rep(i,0,Q){ x[i+1]=x[i]+1; x[i+1]%=mod; y[i+1]=3*y[i]+((x[i+1]*z[i])%mod)*2; y[i+1]%=mod; z[i+1]=z[i]*3; z[i+1]%=mod; } std::vector v(N, {0, 1}); atcoder::lazy_segtree seg(v); vector> ans; rep(i,0,Q){ int l,m,r;cin >> l >> m >> r; m--; l--; seg.apply(l,r,1); int cnt=seg.prod(m,m+1).value; vector tmp={x[cnt],y[cnt],z[cnt]}; ans.pb(tmp); } rep(i,0,Q){ rep(j,0,3){ cout << ans[i][j] << " "; } cout << endl; } }