from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N = int(input())
class SegTree:
    """
    Segment Tree
    """

    def __init__(self, init_val, segfunc, ide_ele):
        """
        初期化

        init_val: 配列の初期値
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新

        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            tk = k>>1
            self.tree[tk] = self.segfunc(self.tree[tk<<1], self.tree[(tk<<1)+1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る

        l: index(0-index)
        r: index(0-index)
        """
        res_l = self.ide_ele
        res_r = self.ide_ele
        
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res_l = self.segfunc(res_l, self.tree[l])
                l += 1
            if r & 1:
                res_r = self.segfunc(self.tree[r - 1], res_r)
            l >>= 1
            r >>= 1
        res = self.segfunc(res_l,res_r)
        return res
        
def matrix_mul(A,B,mod = None):
    nA = len(A)
    mA = len(A[0])
    mB = len(B[0])
    
    tmp = [[0]*mB for _ in range(nA)]
    
    if mod is None:
        for i in range(nA):
            for j in range(mB):
                tmp[i][j] = sum(A[i][k]*B[k][j] for k in range(mA))
        return tmp
    
    for i in range(nA):
        for j in range(mB):
            tmp[i][j] = sum(A[i][k]*B[k][j]%mod for k in range(mA))%mod
    return tmp
    

def matrix_pow(A,n,mod = None):
    nbit = list(str(bin(n))[2:])
    nbit = [int(i) for i in nbit]
    N = len(A)
    C = [[0]*N for _ in range(N)]
    B = A
    for i in range(N):
        C[i][i] = 1
        
    if mod is None:
        
        for i in range(len(nbit)):
            if nbit[-1-i] == 1:
                C = matrix_mul(C,B)
            
            B = matrix_mul(B,B)
        return C
        
    for i in range(len(nbit)):
        if nbit[-1-i] == 1:
            C = matrix_mul(C,B,mod)
        
        B = matrix_mul(B,B,mod)
    
    return C
    
    
X = []
for _ in range(N):
    p,q,r = map(float,input().split())
    
    theta = r/180*math.pi
    c = math.cos(theta)
    s = math.sin(theta)
    Y = [[c,-s,-c*p+s*q + p],
         [s,c,-s*p-c*q + q],
         [0,0,1]]
    X.append(Y)
    
X.reverse()
T = SegTree(X,lambda a,b:matrix_mul(a,b),[[1,0,0],[0,1,0],[0,0,1]])

Q = int(input())
for _ in range(Q):
    s,t,x,y = input().split()
    s = int(s)
    t = int(t)
    x = float(x)
    y = float(y)
    s -= 1
    Z = [[x],[y],[1]]
    A = matrix_mul(T.query(N-t,N-s),Z)
    print(A[0][0],A[1][0])