#include <bits/stdc++.h>
using namespace std;
using lint = long long;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x)
#endif

// Nonrecursive Segment Tree (point-update, range-get)
// - Conditions for operations:
//   - merge_data: [TDATA, TDATA] -> TDATA, e(x, y) == e(y, x)
//   - data2ret: [TDATA, TQUERY] -> TRET
//   - merge_ret: [TRET, TRET] -> TRET, g(defaultRET, x) == x, g(x, y) = g(y, x)
//   - commutability f(e(x, y), q) == g(f(x, q), f(y, q))
template <typename TDATA, typename TRET, typename TQUERY>
struct NonrecursiveSegmentTree
{
    int N;
    TRET defaultRET;
    virtual TDATA merge_data(const TDATA &, const TDATA &) = 0;
    virtual TRET data2ret(const TDATA &) = 0;
    virtual TRET merge_ret(const TRET &, const TRET &) = 0;
    std::vector<TDATA> data;
    inline TDATA& at(int i) { return data[i]; }

    inline void _merge(int i) { at(i) = merge_data(at(i << 1), at((i << 1) + 1)); }
    void initialize(const std::vector<TDATA> &seq, TRET RET_ZERO) {
        N = seq.size();
        defaultRET = RET_ZERO;
        data = seq;
        data.insert(data.end(), seq.begin(), seq.end());
        for (int i = N - 1; i; i--) _merge(i);
    }
    NonrecursiveSegmentTree() = default;
    void update(int pos, const TDATA &x) {
        assert(pos >= 0 and pos < N);
        at(pos + N) = x;
        for (int i = pos + N; i > 1;) i >>= 1, _merge(i);
    }

    // [l, r), 0-indexed
    TRET get(int l, int r) {
        assert(l >= 0 and r <= N);
        TRET retl = defaultRET, retr = defaultRET;
        l += N, r += N;
        while (l < r) {
            if (l & 1) retl = merge_ret(retl, data2ret(data[l++]));
            if (r & 1) retr = merge_ret(data2ret(data[--r]), retr);
            l >>= 1, r >>= 1;
        }
        return merge_ret(retl, retr);
    }
};

#include <boost/multiprecision/cpp_dec_float.hpp>
// using Float = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<25>>;
using Float = boost::multiprecision::cpp_dec_float_50;

struct T
{
    int deg_out;
    Float dx, dy;
};

vector<Float> cosines, sines;

const Float to_rad = acos(Float(-1.0)) / 180;

struct SegmentTree : public NonrecursiveSegmentTree<T, T, tuple<>>
{
    using SegTree = NonrecursiveSegmentTree<T, T, tuple<>>;
    T merge_data(const T &vl, const T &vr) override {

        int d = vl.deg_out;

        Float dx = vl.dx + cosines[d] * vr.dx - sines[d] * vr.dy;
        Float dy = vl.dy + sines[d] * vr.dx + cosines[d] * vr.dy;
        return T{(vl.deg_out + vr.deg_out) % 360, dx, dy};
    };
    T data2ret(const T &v) override { return v; }
    T merge_ret(const T &vl, const T &vr) override { return merge_data(vl, vr); };
    SegmentTree(const std::vector<T> &seq, T defaultmin) : SegTree::NonrecursiveSegmentTree()
    {
        SegTree::initialize(seq, defaultmin);
    };
};


int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(9);

    cosines.resize(360), sines.resize(360);
    REP(d, 360)
    {
        cosines[d] = cos(Float(d) * to_rad);
        sines[d] = sin(Float(d) * to_rad);
    }

    int N, Q;
    cin >> N >> Q;
    vector<T> vec(N + 1);
    vector<int> deg_now(N + 1, 0);
    FOR(i, 1, N + 1) vec[i].dx = 1;
    SegmentTree tree(vec, vec[0]);

    while (Q--)
    {
        int q, i, x;
        cin >> q >> i;
        if (q == 0)
        {
            cin >> x;
            i--;
            deg_now[i] = x;
            vec[i].deg_out = deg_now[i];
            tree.update(i, vec[i]);
        }
        if (q == 1)
        {
            cin >> x;
            vec[i].dx = x;
            tree.update(i, vec[i]);
        }
        if (q == 2)
        {
            auto ret = tree.get(0, i + 1);
            cout << ret.dx << ' ' << ret.dy << '\n';
        }
    }
}