// zzq/std_fast.cpp
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
#define SZ 666666
#define SS 23333333
int an=1,M;
int ls[SS],rs[SS];
ll mi[SS],tg[SS],mx[SS];
void pd(int x) {
    if(tg[x]) {
        tg[x+x]+=tg[x];
        tg[x+x+1]+=tg[x];
        mi[x+x]+=tg[x];
        mi[x+x+1]+=tg[x];
        mx[x+x]+=tg[x];
        mx[x+x+1]+=tg[x];
        tg[x]=0;
    }
}
void upd(int x) {
    mi[x]=min(mi[x+x],mi[x+x+1]);
    mx[x]=max(mx[x+x],mx[x+x+1]);
}
//maybe also add a version of assign 0
void edt(int x,int ql,int qr,ll v) {
    if(rs[x]<ql||qr<ls[x]) return;
    if(ql<=ls[x]&&rs[x]<=qr) {
        if(mi[x]>=v) {
            tg[x]-=v; mi[x]-=v; mx[x]-=v; return;
        }
        else if(mi[x]==mx[x]) {
            assert(v>0); v=mi[x];
            tg[x]-=v; mi[x]-=v; mx[x]-=v; return;
        }
    }
    assert(ls[x]!=rs[x]);
    pd(x); // never pushdown a leaf
    edt(x+x,ql,qr,v);
    edt(x+x+1,ql,qr,v);
    upd(x);
}
ll qry(int x,int q) {
    if(ls[x]==rs[x]) return tg[x];
    if(q<=rs[x+x]) return qry(x+x,q)+tg[x];
    else return qry(x+x+1,q)+tg[x];
}
int xs[SZ],xn=0;
// throw the first <b row
int bs_row(int x,ll b) {
    //if(r<ql||qr<l) return;
    if(mi[x]>=b) return -1;
    if(ls[x]==rs[x]) return ls[x];
    int rl=bs_row(x+x,b-tg[x]);
    if(rl!=-1) return rl;
    return bs_row(x+x+1,b-tg[x]);
}
const int root=1;
ll rl;
ll hook1() {
    rl=qry(1,0);
    // cerr<<rl<<"??\n";
    if(rl==0) return 0;
    int r=bs_row(1,1);
    // cerr<<"found"<<r<<"!  "<<xs[r]<<"\n";
    return xs[r]-1+rl-1;
}
pair<int,ll> bs_all(int x,ll b,ll t) {
    if(rl-mi[x]-t+xs[min(rs[x]+1,xn-1)]-1-1<b) return mp(-1,-1LL);
    if(ls[x]==rs[x]) return mp(ls[x],mi[x]+t);
    auto tl=bs_all(x+x,b,t+tg[x]);
    if(tl.fi!=-1) return tl;
    return bs_all(x+x+1,b,t+tg[x]);
}
// (row, type) of some border segment
pair<ll,ll> qryb(ll b) {
    // note: first get rl from hook(1,1)!
    auto r=bs_all(1,b,0);
    ll x=r.fi,u=r.se;
    if(rl-u+xs[x]-1<=b) return mp(xs[x]+b-(rl-u+xs[x]-1),u);
    else return mp(xs[x]-1,0);
}
char qo[SZ][3]; int qa[SZ],qb[SZ]; ll qq[SZ];
int main() {
    int m;
    scanf("%d",&m);
    xs[xn++]=1;
    int amax=0,bmax=0;
    for(int it=1;it<=m;++it) {
        scanf("%s",qo[it]);
        if(qo[it][0]!='?'&&qo[it][0]!='R') {
            scanf("%d%d",&qa[it],&qb[it]);
            amax=max(amax,qa[it]);
            bmax=max(bmax,qb[it]);
            if(qo[it][0]=='+') ++qa[it];
            xs[xn++]=qa[it];
        }
        else
            scanf("%lld",&qq[it]);
    }
    sort(xs,xs+xn);
    xn=unique(xs,xs+xn)-xs;
    M=1;
    while(M<xn+3) M*=2;
    for(int i=1;i<M;++i) ls[i+M]=rs[i+M]=i;
    for(int i=M-1;i;--i) ls[i]=ls[i+i], rs[i]=rs[i+i+1];
    for(int it=1;it<=m;++it) {
        char o=qo[it][0];
        if(o!='?'&&o!='R') {
            int a=qa[it],b=qb[it];
            // cerr<<a<<"|";
            a=lower_bound(xs,xs+xn,a)-xs;
            assert(a>=0&&a<xn&&b>=1&&b<=1e9);
            // cerr<<a<<"w"<<b<<" "<<o<<"\n";
            if(o=='+') edt(root,0,a-1,-b);
            else if(o=='-') edt(root,a,xn,b);
            else assert(0);
        }
        else if(o=='R') {
            int q=qq[it];
            for(int j=it-1;j>=it-q;--j) {
                assert(j>=1);
                if(qo[j][0]=='?') continue;
                assert(qo[j][0]=='+');
                int a=qa[j],b=qb[j];
                a=lower_bound(xs,xs+xn,a)-xs;
                edt(root,0,a-1,b);
            }
        }
        else {
            ll q=qq[it];
            assert(q>=1&&q<=1e18);
            ll h1=hook1();
            // cerr<<h1<<","<<q<<"  "<<it<<"\n";
            // cerr<<"!"<<h1<<"\n";
            assert(h1%q==0);
            if(!h1) {
                puts("-1 -1");
                continue;
            }
            ll L=0,R=h1/q;
            //1: down, 0: left
            while(R!=L+1) {
                ll M=(L+R)>>1;
                if(qryb(M*q).se) L=M;
                else R=M;
            }
            auto qlq=qryb(L*q);
            // if =1, second is row length
            ll r1=qlq.fi,r2=qryb(R*q).fi;
            // cerr<<L*q<<" "<<R*q<<"   "<<qlq.se<<"\n";
            // cerr<<r1<<"  "<<r2<<"\n";
            ll Y=qlq.se-(q-(r2-r1))+1;
            printf("%lld %lld\n",r1,Y);
        }
    }
    cerr<<"m="<<m<<" amax="<<amax<<" bmax="<<bmax<<endl;
    cerr<<clock()<<"ms\n";
}