#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long
#define double long double
#define MRE assert(0);
const int inf = 1e17;
const double pi = 3.1415926535897932;
const int mod = 998244353;

double P[10], Q[10], R[10];

struct matrix {
	double dat[3][3];
	matrix(){
		rep(i, 3)rep(j, 3)dat[i][j] = 0;
		rep(i, 3)dat[i][i] = 1;
	}
	void init(double theta, double p, double q) {
		theta = theta*pi / 180.0;
		dat[0][0] = cos(theta);
		dat[0][1] = -sin(theta);
		dat[0][2] = q*sin(theta) - p*cos(theta) + p;
		dat[1][0] = sin(theta);
		dat[1][1] = cos(theta);
		dat[1][2] = -p*sin(theta) - q*cos(theta) + q;
	}
};
matrix mul(matrix M2, matrix M1) {
	matrix res;
	rep(i, 3)res.dat[i][i] = 0;
	rep(i, 3) {
		rep(j, 3) {
			rep(k, 3) {
				res.dat[i][j] += M1.dat[i][k] * M2.dat[k][j];
			}
		}
	}
	return res;
}
vector<double>trans(matrix m, double x, double y) {
	vector<double>res(2);
	res[0] = m.dat[0][0] * x + m.dat[0][1] * y + m.dat[0][2];
	res[1] = m.dat[1][0] * x + m.dat[1][1] * y + m.dat[1][2];
	return res;
}
struct segtree {
	matrix ide;
	vector<matrix>node;
	int n;
	void init(int N) {
		n = 1;
		while (n < N)n *= 2;
		node.resize(2 * n);
	}
	void upd(double theta, double p, double q, int k) {
		k += n - 1;
		node[k].init(theta, p, q);
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = mul(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	matrix calc(int a, int b, int k, int l, int r) {
		if (r <= a || b <= l)return ide;
		if (a <= l&&r <= b)return node[k];
		matrix vl = calc(a, b, k * 2 + 1, l, (l + r) / 2);
		matrix vr = calc(a, b, k * 2 + 2, (l + r) / 2, r);
		return mul(vl,vr);
	}
	matrix get(int a, int b) {
		return calc(a, b, 0, 0, n);
	}
};

segtree seg;

signed main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int n; cin >> n;
	seg.init(n);
	if (n > 100000)MRE;
	rep(i, n) {
		double p, q, r; cin >> p >> q >> r;
		if (abs(p) > 1000 || abs(q) > 1000)MRE;
		if (abs(r) > 360)MRE;
		seg.upd(r, p, q, i);
		P[i] = p; Q[i] = q; R[i] = r;
	}
	int q; cin >> q;
	if (q > 100000)MRE;
	rep(j, q) {
		int s, t; double x, y; cin >> s >> t >> x >> y;
		if (s > n || t > n)MRE;
		if (s < 1 || t < 1)MRE;
		if (abs(x) > 1000 || abs(y) > 1000)MRE;
		vector<double>res(2);  res={ x,y };
		for (int i = s - 1; i < t; i++) {
			matrix M; M.init(R[i], P[i], Q[i]);
			res = trans(M, res[0], res[1]);
		}
		printf("%.13Lf %.13Lf\n", res[0], res[1]);
	}
}