#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

// 行列の積
template <class T>
vector<vector<T> > matrixProduct(const vector<vector<T> >& x, const vector<vector<T> >& y)
{
    int a = x.size();
    int b = x[0].size();
    int c = y[0].size();
    vector<vector<T> > z(a, vector<T>(c, 0));
    for(int i=0; i<a; ++i){
        for(int j=0; j<c; ++j){
            for(int k=0; k<b; ++k){
                z[i][j] += x[i][k] * y[k][j];
            }
        }
    }
    return z;
}

int main()
{
    int n, px, py;
    cin >> n >> px >> py;

    vector<vector<vector<int> > > v(n);
    for(int i=0; i<n; ++i){
        int type, d;
        cin >> type >> d;
        if(type == 1)
            v[i] = {{1, 0, d}, {0, 1, 0}, {0, 0, 1}};
        else if(type == 2)
            v[i] = {{1, 0, 0}, {0, 1, d}, {0, 0, 1}};
        else
            v[i] = {{0, 1, 0}, {-1, 0, 0}, {0, 0, 1}};
    }

    vector<pair<int, int> > ans(n);
    vector<vector<int> > mat = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}};
    for(int i=n-1; i>=0; --i){
        mat = matrixProduct(mat, v[i]);
        ans[i].first  = mat[0][0] * px + mat[0][1] * py + mat[0][2];
        ans[i].second = mat[1][0] * px + mat[1][1] * py + mat[1][2];
    }
    for(int i=0; i<n; ++i)
        cout << ans[i].first << ' ' << ans[i].second << endl;

    return 0;
}