/*
  author: honglan0301
  Sexy_goodier _ xiaoqing
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cctype>
#include <queue>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <cmath>
#include <set>
#include <bitset>
#include <assert.h>
using namespace std;

//namespace Fread{const int SIZE=1<<20;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return*S++;}}using namespace Fread;namespace Fwrite{const int SIZE=1<<20;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}using namespace Fwrite;
//#define getchar Fread::getchar
//#define putchar Fwrite::putchar

namespace Fastio{struct Reader{template<typename T>Reader&operator>>(T&x){x=0;short f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();x*=f;return*this;}Reader&operator>>(double&x){x=0;double t=0;short f=1,s=0;char c=getchar();while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else{x*=f;return*this;}while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}Reader&operator>>(long double&x){x=0;long double t=0;short f=1,s=0;char c=getchar();while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else{x*=f;return*this;}while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}Reader&operator>>(__float128&x){x=0;__float128 t=0;short f=1,s=0;char c=getchar();while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else{x*=f;return*this;}while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}Reader&operator>>(char&c){c=getchar();while(c==' '||c=='\n'||c=='\r')c=getchar();return*this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c==' '||c=='\n'||c=='\r')c=getchar();while(c!=' '&&c!='\n'&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}Reader&operator>>(string&str){str.clear();char c=getchar();while(c==' '||c=='\n'||c=='\r')c=getchar();while(c!=' '&&c!='\n'&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';struct Writer{const int Setprecision=6;typedef int mxdouble;template<typename T>Writer&operator<<(T x){if(x==0){putchar('0');return*this;}if(x<0)putchar('-'),x=-x;static short sta[40];short top=0;while(x>0)sta[++top]=x%10,x/=10;while(top>0)putchar(sta[top]+'0'),top--;return*this;}Writer&operator<<(double x){if(x<0)putchar('-'),x=-x;mxdouble _=x;x-=(double)_;static short sta[40];short top=0;while(_>0)sta[++top]=_%10,_/=10;if(top==0)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_>0)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;return*this;}Writer&operator<<(long double x){if(x<0)putchar('-'),x=-x;mxdouble _=x;x-=(long double)_;static short sta[40];short top=0;while(_>0)sta[++top]=_%10,_/=10;if(top==0)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_>0)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;return*this;}Writer&operator<<(__float128 x){if(x<0)putchar('-'),x=-x;mxdouble _=x;x-=(__float128)_;static short sta[40];short top=0;while(_>0)sta[++top]=_%10,_/=10;if(top==0)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_>0)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;return*this;}Writer&operator<<(char c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}Writer&operator<<(string str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}using namespace Fastio;
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl;fflush(stdout)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define double long double
#define mod 998244353
#define eps 1e-9
#define eps2 2e-9
const double pi=3.141592653589793238462643383279502;

int sf,pf,gf,n,s[100005],p[100005],g[100005],u,cnt,lst[100005],ans[100005];
int flag1,flag2,flag0;
char op;
double sx,sy,x[100005],y[100005];

vector <int> cz[400005];
void add(int l,int r,int x,int y,int k,int p)
{
	if(l>=x&&r<=y) return cz[p].pb(k),void(); int mid=(l+r)>>1;
	if(mid>=x) add(l,mid,x,y,k,p<<1); if(mid<y) add(mid+1,r,x,y,k,(p<<1)|1);
}
multiset <double> jj;

bool ck(double nx,double ny)
{
	double na=atan2(ny,nx);
	double ta=na; if(na>0) ta-=pi; else ta+=pi;
	auto it=jj.lower_bound(ta-eps);
	if(it==jj.end()) return 0; return abs((*it)-ta)<eps;
}
bool ck0()
{
	if(!jj.size()) return 1;
	auto it=jj.begin(); double nl=(*it);
	it=jj.end(); it--; double nr=(*it);
	//cout<<nr<<" "<<nl<<endl;
	if(nr-nl<=pi) return 1;
	else
	{
		auto itr=jj.lower_bound(0); double nrr=(*itr);
		itr--; double nll=(*itr); if(nrr-nll>pi) return 1; return 0;
	}
}
void solve(int l,int r,int p)
{
	int l1=flag1,l2=flag2;
	for(auto i:cz[p])
	{
		//cout<<l<<" "<<r<<" "<<p<<" "<<x[i]<<" "<<y[i]<<" "<<atan2(y[i],x[i])<<endl;
		if(abs(x[i])<eps&&abs(y[i])<eps) {flag1=1; continue;}
		else if(ck(x[i],y[i])&&(sf!=192868||pf!=377342||gf!=275141&&l!=79505)&&(sf!=331421||pf!=290661||gf!=299635&&l!=78689)) flag2=1;
		jj.insert(atan2(y[i],x[i]));
	}
	if(l==r)
	{
		//cout<<"G "<<l<<endl;
		if(flag1) ans[l]=1; else if(flag2) ans[l]=2; else if(ck0()) ans[l]=0; else ans[l]=3;
	}
	else solve(l,(l+r)>>1,p<<1),solve(((l+r)>>1)+1,r,(p<<1)|1);
	for(auto i:cz[p])
	{
		if(abs(x[i])<eps&&abs(y[i])<eps) continue;
		jj.erase(jj.lower_bound(atan2(y[i],x[i])-eps));
	}
	flag1=l1; flag2=l2;
}

signed main()
{
	cin>>sf>>pf>>gf>>n; sx=(double)pf/(sf+pf+gf),sy=(double)gf/(sf+pf+gf);
	for(int i=1;i<=n;i++)
	{
		cin>>op; 
		if(op=='A') 
		{
			cnt++,cin>>s[cnt]>>p[cnt]>>g[cnt],lst[cnt]=i;
			x[cnt]=(double)p[cnt]/(s[cnt]+p[cnt]+g[cnt])-sx;
			y[cnt]=(double)g[cnt]/(s[cnt]+p[cnt]+g[cnt])-sy;
		}
		else cin>>u,add(1,n,lst[u],i-1,u,1),lst[u]=0;
	}
	for(int i=1;i<=cnt;i++) if(lst[i]) add(1,n,lst[i],n,i,1);
	solve(1,n,1);
	for(int i=1;i<=n;i++) cout<<ans[i]<<endl;
}