#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template <typename T>
struct SegmentTree{
  using F = function<T(T,T)>;
  int n;
  F f;
  T ti;
  vector<T> dat;

  SegmentTree(){}
  SegmentTree(F f,T ti):f(f),ti(ti){}

  void init(int n_){
    n=1;
    while(n<n_) n<<=1;
    dat.assign(n<<1,ti);
  }

  void build(const vector<T> &v){
    int n_=v.size();
    init(n_);
    for(int i=0;i<n_;i++) dat[n+i]=v[i];
    for(int i=n-1;i;i--)
      dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
  }

  void set_val(int k,T x){
    dat[k+=n]=x;
    while(k>>=1)
      dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]);
  }

  T query(int a,int b){
    if(a>=b) return ti;
    T vl=ti,vr=ti;
    for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {
      if(l&1) vl=f(vl,dat[l++]);
      if(r&1) vr=f(dat[--r],vr);
    }
    return f(vl,vr);
  }

  template<typename C>
  int find(int st,C &check,T &acc,int k,int l,int r){
    if(l+1==r){
      acc=f(acc,dat[k]);
      return check(acc)?k-n:-1;
    }
    int m=(l+r)>>1;
    if(m<=st) return find(st,check,acc,(k<<1)|1,m,r);
    if(st<=l&&!check(f(acc,dat[k]))){
      acc=f(acc,dat[k]);
      return -1;
    }
    int vl=find(st,check,acc,(k<<1)|0,l,m);
    if(~vl) return vl;
    return find(st,check,acc,(k<<1)|1,m,r);
  }

  template<typename C>
  int find(int st,C &check){
    T acc=ti;
    return find(st,check,acc,1,0,n);
  }
};




//INSERT ABOVE HERE
int main(){
  
  using D = double;
  struct T{
    D x,y,theta,sum;
    T(D x,D y,D theta,D sum):x(x),y(y),theta(theta),sum(sum){}
  };

  T ti(0,0,-1,0);
  auto f=[&](T a,T b){
    if(a.theta<0) return b;
    D th=a.sum+b.theta;
    D nx=a.x+(cos(th)*b.x-sin(th)*b.y);
    D ny=a.y+(sin(th)*b.x+cos(th)*b.y);
    return T(nx,ny,a.theta,a.sum+b.theta+b.sum);
  };
  SegmentTree<T> seg(f,ti);

  int n,q;
  cin>>n>>q;
  cout << setprecision(30) << fixed;
  vector<T> vt(n,T(1,0,0,0));
  seg.build(vt);
  const D pi = asin(1) * 2;

  auto print=[&](T res){
    // cout<<":"<<res.x<<' '<<res.y<<' '<<res.theta<<endl;
    cout<<cos(res.theta)*res.x-sin(res.theta)*res.y<<' ';
    cout<<sin(res.theta)*res.x+cos(res.theta)*res.y<<endl;
  };

  for(int j=0;j<q;j++){
    int t;
    cin>>t;
    if(t==0){
      int i,x;
      cin>>i>>x;
      i--;
      vt[i].theta=x*pi/180.0;
      seg.set_val(i,vt[i]);
    }
    if(t==1){
      int i,x;
      cin>>i>>x;
      i--;
      D len=hypot(vt[i].x,vt[i].y);
      vt[i].x*=x/len;
      vt[i].y*=x/len;
      seg.set_val(i,vt[i]);
    }
    if(t==2){
      int i;
      cin>>i;
      print(seg.query(0,i));
    }
  }
  return 0;
}