#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<algorithm>
#include<cctype>
#include<ctime>
#include<deque>
#include<vector>
#include<set>
using namespace std;
const int MAX=1000001;
int n,q,M,deg;
struct node 
{
double x,y;
}
p[MAX];
int main()
{
	freopen("asm_command.in","r",stdin);
	freopen("asm_command.out","w",stdout);
	cin>>n>>q;
	for(int i=1;i<=n;i++)
{
		p[i].x=0;p[i].y=i;
}
	for(int i=1;i<=q;i++){
		cin>>M;
		if(M==0)
{
			int a;
			cin>>a;
			printf("%.1lf %.1lf\n",p[a].x,p[a].y);
}
		if(M==1)
{
			int a,b;
			double dx,dy;
			cin>>a>>b>>dx>>dy;
			for(int j=a;j<=b;j++)
{
				p[j].x+=dx;
				p[j].y+=dy;
}
}
		if(M==2)
{
			int a,b,deg;
			cin>>a>>b>>deg;
			for(int j=a;j<=b;j++)
{if(deg==90)
{
			for(int j=a;j<=b;j++){
		double M=p[j].x;
				p[j].x=p[j].y*-1;
				p[j].y=M;}}
if(deg==180){
for(int j=a;j<=b;j++)
p[j].x*=-1,p[j].y*=-1;}
if(deg==270){for(int j=a;j<=b;j++)p[j].y*=-1;
}
}
}
}
	return 0;
}