#include <bits/stdc++.h>
using namespace std;

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define pconent(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
#define db(x) cerr << #x << " = " << (x) << " ";
#define endln cerr << "\n";

struct Matrix {
    int x[3][3];
    Matrix() {
        FOR(i, 0, 3) FOR(j, 0, 3) x[i][j] = 0;
    }
    Matrix operator * (const Matrix& rhs) {
        Matrix res;
        FOR(i, 0, 3) FOR(j, 0, 3) {
            static long long SQMOD = (long long) MOD * MOD;
            long long tmp = 0;
            FOR(k, 0, 3) {
                tmp += (long long) x[i][k] * rhs.x[k][j];
                if (tmp >= SQMOD) tmp -= SQMOD;
            }
            res.x[i][j] = tmp % MOD;
        }
        return res;
    }
};
Matrix unit() {
    Matrix res;
    FOR(i, 0, 3) res.x[i][i] = 1;
    return res;
}

const int maxn = 1e5 + 5;
int n, q;
int x[maxn];
int y[maxn];
int a[maxn];

Matrix st[maxn << 1];
void upd(int p, Matrix val) {
    for (st[p += n] = val; p > 1; ) p >>= 1, st[p] = st[p << 1] * st[p << 1 | 1];
}
Matrix query(int l, int r) {
    Matrix lres = unit(), rres = unit();
    for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
        if (l & 1) lres = lres * st[l++];
        if (r & 1) rres = st[--r] * rres;
    }
    return lres * rres;
}

void upd(int i) {
    double al = a[i] * PI / 180;
    Matrix val;
    val.x[0][0] = (int) round(cos(al));
    val.x[1][0] = -(int) round(sin(al));
    val.x[2][0] = x[i] * (1 - (int) round(cos(al))) + y[i] * ((int) round(sin(al)));
    val.x[0][1] = (int) round(sin(al));
    val.x[1][1] = (int) round(cos(al));
    val.x[2][1] = y[i] * (1 - (int) round(cos(al))) - x[i] * ((int) round(sin(al)));
    val.x[2][2] = 1;
    auto fixmod = [&] (int& x) {
        x = (x % MOD + MOD) % MOD;
    };
    FOR(i, 0, 3) FOR(j, 0, 3) {
        fixmod(val.x[i][j]);
    }
    upd(i, val);
}

void solve() {
    cin >> n;
    assert(n <= 1e5);
    FOR(i, 0, n) {
        cin >> x[i] >> y[i] >> a[i];
        assert(0 <= x[i] && x[i] <= 1e9);
        assert(0 <= y[i] && y[i] <= 1e9);
        assert(0 <= a[i] && a[i] < 360);
        assert(a[i] % 90 == 0);
        upd(i);
    }
    cin >> q;
    assert(q <= 2e5);
    while (q--) {
        int op; cin >> op;
        assert(op == 1 || op == 2);
        if (op == 1) {
            int x, y, l, r; cin >> x >> y >> l >> r; l--, r--;
            assert(0 <= x && x <= 1e9);
            assert(0 <= y && y <= 1e9);
            assert(0 <= l && l <= r && r < n);
            Matrix res = query(l, r);
            int xx = ((long long) x * res.x[0][0] + (long long) y * res.x[1][0] + res.x[2][0]) % MOD;
            int yy = ((long long) x * res.x[0][1] + (long long) y * res.x[1][1] + res.x[2][1]) % MOD;
            cout << xx << " " << yy << "\n";
        }
        else {
            int u, xx, yy, aa; cin >> u >> xx >> yy >> aa; u--;
            assert(0 <= u && u < n);
            assert(0 <= xx && xx <= 1e9);
            assert(0 <= yy && yy <= 1e9);
            assert(0 <= aa && aa < 360);
            assert(aa % 90 == 0);
            x[u] = xx, y[u] = yy, a[u] = aa;
            upd(u);
        }
    }
}

int main(int argc, char* argv[]) {
    ios_base::sync_with_stdio(0), cin.tie(0);
    if (argc > 1) {
        assert(freopen(argv[1], "r", stdin));
    }
    if (argc > 2) {
        assert(freopen(argv[2], "wb", stdout));
    }
    solve();
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}