#include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<57;
const double pi=acos(-1);
const double eps=1e-6;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,-0};
const int DX[8]={-1,-1,-1,0,1,1,1,0},DY[8]={1,0,-1,-1,-1,0,1,1};

vvl mul(vvl A,vvl B){
	vvl C(A.size(),vl(B[0].size()));
	for(int i=0;i<A.size();i++) for(int k=0;k<B.size();k++) for(int j=0;j<B[0].size();j++) C[i][j]+=A[i][k]*B[k][j];
	return C;
}

int n,x,y;

vvl E(3,vl(3));

int main(){
	cin>>n>>x>>y;
	E[0][0]=1;
	E[1][1]=1;
	E[2][2]=1;
	vvl A=E;
	vector<vvl> X(n);
	for(int i=0;i<n;i++){
		int t;
		cin>>t;
		vvl B;
		if(t==1){
			int dx;
			cin>>dx;
			B=E;
			B[0][2]=dx;
			A=mul(B,A);
			B[0][2]=-dx;
		}
		if(t==2){
			int dy;
			cin>>dy;
			B=E;
			B[1][2]=dy;
			A=mul(B,A);
			B[1][2]=-dy;
		}
		if(t==3){
			B=vvl(3,vl(3));
			B[0][1]=1;
			B[1][0]=-1;
			B[2][2]=1;
			A=mul(B,A);
			B[0][1]=-1;
			B[1][0]=1;
		}
		X[i]=B;
	}
	for(int i=0;i<n;i++){
		vvl C(3,vl(1));
		C[0][0]=x;
		C[1][0]=y;
		C[2][0]=1;
		vvl B=mul(A,C);
		cout<<B[0][0]<<' '<<B[1][0]<<' '<<endl;
		A=mul(A,X[i]);
	}
}