#include <iostream>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <stdlib.h>
using namespace std;
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define MAXN 11111
#define PI acos(-1.0)
#define eps 1e-8
struct Node
{
double x, y;
int flag;
}node[MAXN << 2];
int angle[MAXN];
void pushup( int rt)
{
node[rt].x = node[rt<<1].x + node[rt<<1|1].x;
node[rt].y = node[rt<<1].y + node[rt<<1|1].y;
}
void work( int rt, int deg)
{
double r = deg*PI/180;
double x = node[rt].x;
double y = node[rt].y;
node[rt].x = x*cos(r)-y*sin(r);
node[rt].y = x*sin(r)+y*cos(r);
}
void pushdown( int rt)
{
if(node[rt].flag)
{
node[rt<<1].flag += node[rt].flag;
node[rt<<1|1].flag += node[rt].flag;
work(rt<<1, node[rt].flag);
work(rt<<1|1, node[rt].flag);
node[rt].flag = 0;
}
}
void build( int l, int r, int rt)
{
node[rt].x = node[rt].y = 0;
node[rt].flag = 0;
if( l == r)
{
scanf("%lf",&node[rt].y);
return ;
}
int m = ( l + r)>>1;
build(lson);
build(rson);
pushup(rt);
}
void update( int L, int R, int val, int l, int r, int rt)
{
if(L<= l && r <= R)
{
node[rt].flag += val;
work(rt, val);
return ;
}
pushdown( rt);
int m = ( r + l) >> 1;
if(L <= m) update(L, R, val, lson);
if(R > m) update(L, R, val, rson);
pushup(rt);
}
int main()
{
int n,m;
int cnt = 0;
while(scanf("%d%d",&n,&m)==2)
{
if(cnt++) puts("");
build(1,n ,1);
for(int i = 1; i <= n; i++)
angle[i] = 180;
while(m--)
{
int s,a;
scanf("%d%d",&s,&a);
int x = (a-angle[s]+360)%360;
update(s+1, n, x, 1, n, 1);
angle[s]=a;
printf("%.2lf %.2lf\n",node[1].x+eps,node[1].y+eps);
}
}
return 0;
}
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <stdlib.h>
using namespace std;
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define MAXN 11111
#define PI acos(-1.0)
#define eps 1e-8
struct Node
{
double x, y;
int flag;
}node[MAXN << 2];
int angle[MAXN];
void pushup( int rt)
{
node[rt].x = node[rt<<1].x + node[rt<<1|1].x;
node[rt].y = node[rt<<1].y + node[rt<<1|1].y;
}
void work( int rt, int deg)
{
double r = deg*PI/180;
double x = node[rt].x;
double y = node[rt].y;
node[rt].x = x*cos(r)-y*sin(r);
node[rt].y = x*sin(r)+y*cos(r);
}
void pushdown( int rt)
{
if(node[rt].flag)
{
node[rt<<1].flag += node[rt].flag;
node[rt<<1|1].flag += node[rt].flag;
work(rt<<1, node[rt].flag);
work(rt<<1|1, node[rt].flag);
node[rt].flag = 0;
}
}
void build( int l, int r, int rt)
{
node[rt].x = node[rt].y = 0;
node[rt].flag = 0;
if( l == r)
{
scanf("%lf",&node[rt].y);
return ;
}
int m = ( l + r)>>1;
build(lson);
build(rson);
pushup(rt);
}
void update( int L, int R, int val, int l, int r, int rt)
{
if(L<= l && r <= R)
{
node[rt].flag += val;
work(rt, val);
return ;
}
pushdown( rt);
int m = ( r + l) >> 1;
if(L <= m) update(L, R, val, lson);
if(R > m) update(L, R, val, rson);
pushup(rt);
}
int main()
{
int n,m;
int cnt = 0;
while(scanf("%d%d",&n,&m)==2)
{
if(cnt++) puts("");
build(1,n ,1);
for(int i = 1; i <= n; i++)
angle[i] = 180;
while(m--)
{
int s,a;
scanf("%d%d",&s,&a);
int x = (a-angle[s]+360)%360;
update(s+1, n, x, 1, n, 1);
angle[s]=a;
printf("%.2lf %.2lf\n",node[1].x+eps,node[1].y+eps);
}
}
return 0;
}