from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
from fractions import Fraction
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def dot(aa,bb):
    return [[sum(a*b for a,b in zip(row,col)) for col in zip(*bb)] for row in aa]

n,x,y=MI()
cc=LLI(n)

ans=[]
mat=[[1,0,0],[0,1,0],[0,0,1]]
xy=[[x,y,1]]

for c in cc[::-1]:
    if c[0]==1:
        mat=dot([[1,0,0],[0,1,0],[c[1],0,1]],mat)
    if c[0]==2:
        mat=dot([[1,0,0],[0,1,0],[0,c[1],1]],mat)
    if c[0]==3:
        mat=dot([[0,-1,0],[1,0,0],[0,0,1]],mat)
    aa=dot(xy,mat)
    ans.append((aa[0][0],aa[0][1]))

for x,y in ans[::-1]:print(x,y)