#include<bits/stdc++.h>
#define int long long
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pdd pair<double,double>
#define pb push_back
#define umap unordered_map
#define mset multiset
#define pq priority_queue
#define ull unsigned long long
#define i128 __int128
#define ld long double
#define fixs fixed<<setprecision
#define FileIn(x) freopen(x".in","r",stdin)
#define FileOut(x) freopen(x".out","w",stdout)
#define FileIO(x) FileIn(x),FileOut(x);
const int maxn=1e5+10;
struct Mat{
    int n,m,a[5][5];
    void getI(int N){
        n=m=N;
        for(int i=1;i<=N;i++){
            for(int j=1;j<=N;j++) a[i][j]=(i==j);
        }
    }
    Mat operator *(Mat x){
        Mat res;
        res.n=n,res.m=x.m;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=x.m;j++) res.a[i][j]=0;
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                for(int k=1;k<=x.m;k++) res.a[i][k]+=a[i][j]*x.a[j][k];
            }
        }
        return res;
    }
    void output(){
        cout<<"--------"<<endl;
        for(int i=1;i<=n;i++,cout<<endl){
            for(int j=1;j<=m;j++) cout<<a[i][j]<<" ";
        }
    }
}a[maxn],b[maxn],A;
int n,op[maxn],x[maxn];
void solve(){
    cin>>n>>A.a[1][1]>>A.a[2][1],A.a[3][1]=1,A.n=3,A.m=1;
    for(int i=1;i<=n;i++){
        cin>>op[i];
        if(op[i]!=3) cin>>x[i],a[i].getI(3);
        else a[i].n=a[i].m=3;
        if(op[i]==1) a[i].a[1][3]=x[i];
        if(op[i]==2) a[i].a[2][3]=x[i];
        if(op[i]==3) a[i].a[1][2]=a[i].a[3][3]=1,a[i].a[2][1]=-1;
    }b[n+1].getI(3);
    for(int i=n;i;i--) b[i]=b[i+1]*a[i];
    for(int i=1;i<=n;i++) cout<<(b[i]*A).a[1][1]<<" "<<(b[i]*A).a[2][1]<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
检查freopen，尤其是后缀名
检查空间
检查调试语句是否全部注释
*/