#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <stack>
#include <vector>
#include <map>
#include <queue>
#include <ctime>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
const int inf=1061109567;
const int maxn=100010;
const int maxm=25;
const int mod=1000000007;

struct node
{
    int add_x;
    int add_y;
} tree[3*maxn];

void build_tree(int l,int r,int dir)
{
    if(l==r)
    {
        tree[dir].add_y=l;
        tree[dir].add_x=0;
        return;
    }
    int m=(l+r)>>1;
    build_tree(l,m,dir*2);
    build_tree(m+1,r,dir*2+1);
}

void Add(int al,int ar,int dx,int dy,int l,int r,int dir)
{
    if(al>r||ar<l) return;
    if(al<=l&&ar>=r)
    {
        tree[dir].add_x+=dx;
        tree[dir].add_y+=dy;
        return;
    }
    int m=(l+r)>>1;
    Add(al,ar,dx,dy,l,m,dir*2);
    Add(al,ar,dx,dy,m+1,r,dir*2+1);
}

node query(int pos,int l,int r,int dir,int sx,int sy)
{
    if(l==r)
    {
        return (node){tree[dir].add_x+sx,tree[dir].add_y+sy};
    }
    int m=(l+r)>>1;
    if(pos<=m) return query(pos,l,m,dir*2,sx+tree[dir].add_x,sy+tree[dir].add_y);
    else return query(pos,m+1,r,dir*2+1,sx+tree[dir].add_x,sy+tree[dir].add_y);
}

int main()
{
    freopen("asm_command.in","r",stdin);
    freopen("asm_command.out","w",stdout);
    //clock_t st=clock();
    int n,q;scanf("%d%d",&n,&q);
    build_tree(1,n,1);
    node ans;int kase;
    int a,b,dx,dy;
    while(q--)
    {
        scanf("%d",&kase);
        if(kase==0)
        {
            scanf("%d",&a);
            ans=query(a,1,n,1,0,0);
            printf("%d.0 %d.0\n",ans.add_x,ans.add_y);
        }
        if(kase==1)
        {
            scanf("%d%d%d%d",&a,&b,&dx,&dy);
            Add(a,b,dx,dy,1,n,1);
        }
    }
    //clock_t ed=clock();
    //printf("\nTime used : %.5lf Ms\n",double(ed-st)/CLOCKS_PER_SEC);
    return 0;
}