#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

template <class T, int N> struct matrix_ {
	array<T, N*N> val;

	matrix_(vector<vector<T>> ini) {
		for (int i = 0; i < N; i++) for (int j = 0; j < N; j++)
			val[i * N + j] = ini[i][j];
	}

	matrix_(int d = 0) {
		for (int i = 0; i < N; i++) for (int j = 0; j < N; j++)
			val[i * N + j] = T((i == j) * d);
	}

	matrix_ operator+(const matrix_ &x) const {
		matrix_ ret;
		for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {
			ret.val[i * N + j] = val[i * N + j] + x.val[i * N + j];
		}
		return ret;
	}

	matrix_ operator*(const matrix_ &x) const {
		matrix_ ret;
		for (int i = 0; i < N; i++) for (int k = 0; k < N; k++) for (int j = 0; j < N; j++) {
			ret.val[i * N + j] += val[i * N + k] * x.val[k * N + j];
		}
		return ret;
	}

	vector<T> operator*(const vector<T> &v) const {
		vector<T> ret(N);
		for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {
			ret[i] += val[i * N + j] * v[j];
		}
		return ret;
	}

	matrix_ operator^(unsigned long long p) const {
		matrix_ ret(1);
		matrix_ x(*this);
		while (p) {
			if (p & 1) ret = ret * x;
			x = x * x;
			p >>= 1;
		}
		return ret;
	}

	T& at(int row, int col) {
		return val[row * N + col];
	}

	const T& at(int row, int col) const {
		return val[row * N + col];
	}
};
template <class T, int N> ostream& operator<<(ostream& os, const matrix_<T, N>& mat) {
	vector<vector<T>> vec(N, vector<T>(N));
	for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) vec[i][j] = mat.at(i, j);
	os << vec;
	return os;
}
using Mat = matrix_<ll, 3>;
const Mat ini(1);

template<class V, class Merge> struct SegmentTree {
	const int n;
	const V unit_value;
	vector<V> val;

	SegmentTree(int _n) : n(1 << (32-__builtin_clz(_n-1))), unit_value(Merge::unit()), val(n * 2, unit_value) {}

	V get(int i) const { return val[i + n]; }
	void set(int i, const V &v) { val[i + n] = v; }

	void build() {
		for (int i = n - 1; i > 0; i--) val[i] = Merge::merge(val[i << 1], val[i << 1 | 1]);
	}

	void update(int i, const V &v) {
		i += n;
		val[i] = v;
		while (i > 1) {
			i >>= 1;
			val[i] = Merge::merge(val[i << 1], val[i << 1 | 1]);
		}
	}

	V query(int l, int r) const {
		l = max(0, min(n, l)) + n;
		r = max(0, min(n, r)) + n;
		V ret1 = unit_value, ret2 = unit_value;
		while (l < r) {
			if (l & 1) ret1 = Merge::merge(ret1, val[l++]);
			if (r & 1) ret2 = Merge::merge(val[--r], ret2);
			l >>= 1;
			r >>= 1;
		}
		return Merge::merge(ret1, ret2);
	}
};
template<class V, class Merge> ostream& operator<<(ostream& os, const SegmentTree<V, Merge>& seg) {
	vector<V> vec;
	for (int i = 0; i < seg.n; i++) {
		vec.emplace_back(seg.get(i));
	}
	os << vec;
	return os;
}

struct Merge {
	static Mat merge(const Mat &l, const Mat &r) {
		return r * l;
	}
	static Mat unit() { return ini; }
};

void Main() {
	int n = ri();
	ll px = ri(), py = ri();

	SegmentTree<Mat, Merge> seg(n);
	Mat rot = Mat({{0,1,0},{-1,0,0},{0,0,1}});

	rep(i, n) {
		int t = ri();
		if (t == 3) {
			seg.set(i, rot);;
		}
		else {
			int a = ri();
			if (t == 1) {
				seg.set(i, Mat({{1,0,a},{0,1,0},{0,0,1}}));
			}
			else {
				seg.set(i, Mat({{1,0,0},{0,1,a},{0,0,1}}));
			}
		}
	}
	seg.build();

	vl p{px, py, 1};

	rep(i, n) {
		Mat trans = seg.query(i, n);
		vl ans = trans * p;
		cout << ans[0] << ' ' << ans[1] << endl;
	}

}

signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();
	return 0;
}