#include<bits/stdc++.h>
#define LL long long
#define SZ(x) ((LL)(x.size()))
using namespace std;
long long read(){
  long long q=0,w=1;
  char ch=getchar();
  while(ch>'9' || ch<'0'){if(ch=='-')w=-1;ch=getchar();}
  while(ch>='0'&&ch<='9'){q=q*10+(ch-'0');ch=getchar();}
  return q*w;
}
void write(LL x){
  if(x<0){putchar('-');x=(-x);}
  if(x>9)write(x/10);
  putchar('0'+x%10);
}
void writeln(LL x){write(x);puts("");}
void writecs(LL x){write(x);putchar(' ');}

const long long lim = 1000000000;
namespace seg{
  const long long SIZE = 20000000+95;
  struct node{LL l,r,d,t;}s[SIZE];LL tot;
  void pushup(LL p){s[p].d=max(s[s[p].l].d,s[s[p].r].d)+s[p].t;return ;}
  void update(LL &p,LL x,LL y,LL v,LL l=1,LL r=lim){//将 [x,y] 区间内的部分加 v
    if(y<l || r<x || x>y)return ;
    s[++tot]=s[p];p=tot;
    if(x<=l&&r<=y){s[p].d+=v;s[p].t+=v;return ;}
    LL mid=(l+r)>>1;
    if(x<=mid)update(s[p].l,x,y,v,l,mid);
    if(mid<y)update(s[p].r,x,y,v,mid+1,r);
    pushup(p);return ;
  }
  void make(LL &p,LL l=1,LL r=lim,LL tag=0){//将小于 0 的部分设置为 0
    s[++tot]=s[p];p=tot;
    if(s[p].d+tag<=0){s[p].l=s[p].r=0;s[p].d=s[p].t=-tag;return ;}
    if(l==r)return ;
    tag+=s[p].t;LL mid=(l+r)>>1;
    if(s[s[p].r].d+tag>=0)make(s[p].r,mid+1,r,tag);
    else {make(s[p].l,l,mid,tag);make(s[p].r,mid+1,r,tag);}
    pushup(p);return ;
  }
  LL query(LL p,LL x,LL l=1,LL r=lim){//得到其中一行的值
    if(!p)return 0;
    if(l==r)return s[p].t;
    LL mid=(l+r)>>1;
    if(x<=mid)return query(s[p].l,x,l,mid)+s[p].t;
    else return query(s[p].r,x,mid+1,r)+s[p].t;
  }
  LL get(LL p,LL y,LL l=1,LL r=lim,LL tag=0){//得到其中一列的值
    if(l==r)return ((s[p].d+tag>=y)?(l):(l-1));
    tag+=s[p].t;LL mid=(l+r)>>1;
    if(s[s[p].r].d+tag>=y)return get(s[p].r,y,mid+1,r,tag);
    else return get(s[p].l,y,l,mid,tag);
  }
  LL bound(LL p,LL __X,LL __Y,LL k,LL l=1,LL r=lim,LL tag=0){
    if(l==r){
      LL vl=0;
      {//l
	LL X=(__X-l+1);
	LL Y=((s[p].d+tag)-__Y+1);
	vl=((X<=0||Y<=0)?(0):(X+Y-1));
      }
      return ((vl<=k)?(l):(l+1));
    }
    tag+=s[p].t;LL mid=(l+r)>>1;
    LL vl=0;
    {//mid+1
      LL X=(__X-(mid+1)+1);
      LL Y=((s[s[p].r].d+tag)-__Y+1);
      vl=((X<=0||Y<=0)?(0):(X+Y-1));
    }
    if(vl<=k)return bound(s[p].l,__X,__Y,k,l,mid,tag);
    else return bound(s[p].r,__X,__Y,k,mid+1,r,tag);
  }
}

const long long N = 300000+95;
long long T,rt,__rt[N];
LL GET(LL x,LL y){
  LL X=(seg::get(rt,y)-x+1);
  LL Y=(seg::query(rt,x)-y+1);
  if(X<=0||Y<=0)return 0;
  return (X+Y-1);
}

void solve(LL x,LL y,LL q){
  LL p=GET(x,y);assert((p%q)==0);
  if(p==q){writecs(x);writeln(y);return ;}
  LL K=(p/q);LL k=(K>>1)*q;
  LL ans=lim+1;
  
  LL X=seg::get(rt,y);
  ans=seg::bound(rt,X,y,k);
  //  cout<<" ans = "<<ans<<endl;
  /*  while(l<=r){
    LL mid=(l+r)>>1;
    if(GET(mid,y)>k){l=mid+1;}
    else {r=mid-1;ans=mid;}
  }*/
  
  if(GET(ans,y)==k){solve(ans,y,q);return ;}
  assert(ans>x);
  LL Y=((ans==(lim+1))?(0):seg::query(rt,ans))+1;
  LL c=GET(x,Y);
  Y+=(c-(p-k));
  //  assert(GET(x,Y)==(p-k));
  solve(x,Y,q);return ;
}

int main(){
  T=read();
  for(LL t=1;t<=T;t++){
    char opt;cin>>opt;
    if(opt=='+'){
      LL a=read(),b=read();
      seg::update(rt,1,a,b);
    }
    else if(opt=='-'){
      LL a=read(),b=read();
      seg::update(rt,a,lim,-b);seg::make(rt);
      
    }
    else if(opt=='R'){
      LL u=read();
      rt=__rt[(t-1)-u];
    }
    else if(opt=='?'){
      LL q=read();
      LL Y=seg::query(rt,1),X=seg::get(rt,1);
      assert((X!=0)==(Y!=0));
      if(!X){puts("-1 -1");continue;}
      /*      cout<<"> X = "<<X<<" Y = "<<Y<<endl;
      for(LL i=1;i<=X;i++){
	for(LL j=1;j<=Y;j++)cout<<GET(i,j)<<" ";
	cout<<endl;
	}*/
      solve(1,1,q);
    }
    __rt[t]=rt;
  }
  return 0;
}
/*
test data:
input:
9
+ 1000000000 1
+ 1000000000 1000000000
+ 1000000000 1000000000
+ 1000000000 1000000000
+ 1000000000 1000000000
+ 1000000000 1000000000
? 3000000000
R 4
? 3000000000
output:
1 3000000001
1 1
*/