#include using namespace atcoder; // using mint = modint1000000007; // using mint = modint998244353; #include #define rep(i, n) for (int i = 0; i < (int)n; ++i) #define rrep(i, n) for (int i = (int)n-1; i >= 0; --i) using namespace std; using ll = long long; template inline bool chmax(T& a, const T& b) { if (a < b){ a = b; return true; } return false; } template inline bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } return false; } /** * @brief 多次元 vector の作成 * @author えびちゃん */ namespace detail { template auto make_vec(vector& sizes, T const& x) { if constexpr (N == 1) { return vector(sizes[0], x); } else { int size = sizes[N-1]; sizes.pop_back(); return vector(size, make_vec(sizes, x)); } } } template auto make_vec(int const(&sizes)[N], T const& x = T()) { vector s(N); for (int i = 0; i < N; ++i) s[i] = sizes[N-i-1]; return detail::make_vec(s, x); } __attribute__((constructor)) void fast_io() { ios::sync_with_stdio(false); cin.tie(nullptr); } struct S { complex point; double theta; }; S op(S a, S b) { b.point *= polar(1.0, a.theta); return {a.point + b.point, a.theta + b.theta}; } S e() { return {complex(0, 0), 0}; }; int main() { int n, q; cin >> n >> q; vector ps(n, {complex(1, 0), 0}); segtree seg(ps); while (q--) { int t, i, x; cin >> t; if (t == 0) { cin >> i >> x; --i; S p = seg.get(i); double d = abs(p.point); double theta = x * acos(-1) / 180; p.point = polar(d, theta); p.theta = theta; seg.set(i, p); } else if (t == 1) { cin >> i >> x; --i; S p = seg.get(i); p.point = polar((double)x, p.theta); seg.set(i, p); } else { cin >> i; --i; S p = seg.prod(0, i+1); cout << fixed << setprecision(9) << p.point.real() << ' ' << p.point.imag() << '\n'; } } }