#include "bits/stdc++.h" #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector veci; typedef vector vecll; typedef vector vecs; template using Hash=unordered_map; #define REP(i, a, n) for(ll i = a; i < n; i++) #define RREP(i, a, n) for(ll i = n-1; i >= a; i--) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) RREP(i, 0, n) #define MD 1000000007 template T read(){T a;cin >> a;return a;} template void read(T& a){cin >> a;} template void read(T& a, Args&... args){cin >> a; read(args...);} template void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}} template void write(T a){cout << setprecision(12) << a << endl;} template void write(T a, Args... args){cout << setprecision(12) << a << c; write(args...);} template void warr(vector a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;} template void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;} void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}} void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}} ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}} ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;} typedef long long Num; #define MOD (ll)(1e18)+(ll)10 //!!!!!!!MODが大きい場合、"*="を書き換えること! struct Matrix { vector > v, w; Matrix():v(3, vector(3)) {} Matrix(int n, int m): v(n, vector(m)) { assert(n > 0 && m > 0); } inline int height() const { return (int)v.size(); } inline int width() const { return (int)v[0].size(); } inline Num& at(int i, int j) { assert(0 <= i && i < height() && 0 <= j && j < width()); return v[i][j]; } inline const Num& at(int i, int j) const { assert(0 <= i && i < height() && 0 <= j && j < width()); return v[i][j]; } static Matrix identity(int n) { Matrix A(n, n); rep(i, n) A.at(i, i) = 1; return A; } inline static Matrix identity(const Matrix& A) { assert(A.height() == A.width()); return identity(A.height()); } Matrix operator*(const Matrix& B) const{ Matrix A(*this); return A*=B; } Matrix& operator*=(const Matrix& B) { int n = height(), m = B.width(), p = B.height(); assert(p == width()); w.resize(n, vector(m, 0)); rep(i, n) rep(j, m) { //MOD = 1000000007の場合、1000000012000000036となり、 //2^64にオーバーフローするのは2^64-1-1000000006^2くらいで、それは最上位4bitが立っているから //!MODが違う場合、書き換えること! Num x = 0; rep(k, p) { x += at(i, k) * B.at(k, j); if((x >> 60) == 0xf) x %= MOD; } x %= MOD; w[i][j] = x; } v.swap(w); return *this; } Matrix& operator+=(const Matrix& B) { int n = height(), m = width(); assert(n == B.height() && m == B.width()); rep(i, n) rep(j, m) { at(i, j) += B.at(i, j); if(at(i, j) >= MOD) at(i, j) -= MOD; } return *this; } void undomult() { v.swap(w); } }; ostream& operator<<(ostream& o, const Matrix& A) { int n = A.height(), m = A.width(); rep(i, n) { o << "["; rep(j, m) o << A.at(i, j) << (j+1 == m ? "]\n" : ","); } return o; } struct GetRangeSegmentTree { typedef Matrix Val; static Val combineVal(const Val &x, const Val &y) { return y * x; } static void combinesVal(Val &x, const Val &y) { x = y * x; } static Val identityVal() { return Val::identity(3); } vector nodes; int n; void init(int n_, const Val &v = Val()) { init(vector(n_, v)); } void init(const vector &u) { n = 1; while(n < (int)u.size()) n *= 2; nodes.resize(n); nodes.insert(nodes.end(), u.begin(), u.end()); nodes.resize(n * 2, Val()); for(int i = n-1; i > 0; -- i) nodes[i] = combineVal(nodes[i*2], nodes[i*2+1]); } Val get(int i) { return nodes[i + n]; } Val getRange(int l, int r) const { Val m = identityVal(); static ll indices[100]; int k = 0; for(; l && l + (l&-l) <= r; l += l&-l) combinesVal(m, nodes[(n+l) / (l&-l)]); for(; l < r; r -= r&-r) indices[k ++] = (n+r) / (r&-r) - 1; while(-- k >= 0) combinesVal(m, nodes[indices[k]]); return m; } void set(int i, const Val &x) { i += n; nodes[i] = x; for(i >>= 1; i > 0; i >>= 1) nodes[i] = combineVal(nodes[i*2], nodes[i*2+1]); } }; template inline void inMat(Matrix &m,Num a[N][M]){ rep(i,N)rep(j,M)m.at(i,j)=a[i][j]; } int main(void) { ll n,px,py; read(n,px,py); ll m90[3][3]={{0,1,0}, {-1,0,0}, {0,0,1}}; ll mp[3][3]={{1,0,px}, {0,1,py}, {0,0,1}}; Matrix mt90(3,3); Matrix mtp(3,3); Matrix id=Matrix::identity(3); inMat<3>(mt90,m90); inMat<3>(mtp,mp); GetRangeSegmentTree st; st.init(n+3,id); rep(i,n){ ll cm,d; read(cm); if(cm==1){ read(d); id.at(0,2)=d; id.at(1,2)=0; st.set(i,id); } else if(cm==2){ read(d); id.at(0,2)=0; id.at(1,2)=d; st.set(i,id); } else{ st.set(i,mt90); } } rep(i,n){ Matrix m=st.getRange(i,n)*mtp; write(m.at(0,2),m.at(1,2)); } return 0; }