#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <tuple>
#include <functional>

template <class T>
struct SegmentTree {
    using Merger = std::function<T(T, T)>;

    int length;
    std::vector<T> dat;
    T unit;
    Merger merge;

    SegmentTree() = default;

    SegmentTree(int n, const T& unit, const Merger& merge)
        : length(1), unit(unit), merge(merge) {
        while (length < n) length <<= 1;
        dat.assign(length * 2, unit);
    }

    template <class Container>
    SegmentTree(const Container& elems, const T& unit, const Merger& merge)
        : length(1), unit(unit), merge(merge) {
        int n = elems.size();
        while (length < n) length <<= 1;

        dat.assign(length * 2, unit);

        std::copy(elems.begin(), elems.end(), dat.begin() + length);

        for (int nidx = length - 1; nidx >= 1; --nidx) {
            T vl = dat[nidx * 2 + 0];
            T vr = dat[nidx * 2 + 1];
            dat[nidx] = merge(vl, vr);
        }
    }

    void update(int nidx, const T& elem) {
        nidx += length;
        dat[nidx] = elem;

        while (nidx > 0) {
            nidx >>= 1;
            T vl = dat[nidx * 2 + 0];
            T vr = dat[nidx * 2 + 1];
            dat[nidx] = merge(vl, vr);
        }
    }

    T fold(int ql, int qr) const {
        ql = std::max(ql, 0);
        qr = std::min(qr, length);
        ql += length, qr += length;

        T lacc = unit, racc = unit;
        while (ql < qr) {
            if (ql & 1) {
                lacc = merge(lacc, dat[ql]);
                ++ql;
            }
            if (qr & 1) {
                --qr;
                racc = merge(dat[qr], racc);
            }
            ql >>= 1, qr >>= 1;
        }

        return merge(lacc, racc);
    }

    T get(int idx) const { return dat[idx + length]; }
    T fold_all() const { return dat[1]; }
};

using ldouble = long double;
const ldouble PI = std::acos(-1.L);

void solve() {
    int n;
    std::cin >> n;

    SegmentTree<std::tuple<ldouble, ldouble, ldouble>>
        seg(n, std::make_tuple(0, 0, 0),
            [](auto a, auto b) {
                auto [al, at, ap] = a;
                auto [bl, bt, bp] = b;

                auto x = al * std::cos(at + ap) + bl * std::cos(ap + bt + bp),
                     y = al * std::sin(at + ap) + bl * std::sin(ap + bt + bp);
                return std::make_tuple(std::hypot(x, y),
                                       std::atan2(y, x) - (ap + bp),
                                       ap + bp);
            });
    for (int i = 0; i < n; ++i) seg.update(i, std::make_tuple(1, 0, 0));

    int q;
    std::cin >> q;
    while (q--) {
        int c;
        std::cin >> c;

        switch (c) {
            case 0: {
                int i;
                ldouble p;
                std::cin >> i >> p;
                --i;
                p *= PI / 180;

                auto [sl, st, sp] = seg.get(i);
                seg.update(i, std::make_tuple(sl, st, p));
                break;
            }

            case 1: {
                int i;
                ldouble l;
                std::cin >> i >> l;
                --i;

                auto [sl, st, sp] = seg.get(i);
                seg.update(i, std::make_tuple(l, st, sp));
                break;
            }

            case 2: {
                int i;
                std::cin >> i;

                auto [l, t, p] = seg.fold(0, i);
                std::cout << l * std::cos(t + p) << " " << l * std::sin(t + p) << "\n";
                break;
            }
        }
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cout << std::fixed << std::setprecision(10);
    std::cerr << std::fixed << std::setprecision(10);

    solve();

    return 0;
}