#include <stdio.h>
#include <stdlib.h>
int a,b,N;

struct tah
{
	int a,b,souc;
	char ca,cb;
	int avail;
};

int qsort1(const void *a, const void *b)
{
	return ((struct tah *)b)->souc - ((struct tah *)a)->souc;
}

struct tah A[361];

void spocti()
{
	int i;
	for(i=0;i<N;i++)
	{
		scanf("%d %d %c %c",&A[i].a,&A[i].b,&A[i].ca,&A[i].cb);
		A[i].avail  = 1;
		A[i].souc = A[i].a+A[i].b;
	}
	/* vyhazet, co naberem flawlessly */
	for(i=0;i<N;i++)if(A[i].ca == 'S')
	{
		A[i].avail = 0;
		a+=A[i].a;
	}
	qsort(A,N,sizeof(struct tah),qsort1);

	int sc[2];
	sc[0]=0;sc[1]=0;
	int who=0;
	for(i=0;i<N;i++)
	{
		if((A[i].ca == 'G')&&(A[i].cb == 'G'))
		{
			sc[who]+=A[i].souc;
			who^=1;
		}
	}
	int maxjeho = 0;
	int index = 0;
	for(i=0;i<N;i++)
	{
		if((A[i].ca == 'G')&&(A[i].cb == 'S'))
			if(A[i].souc>=maxjeho)
			{
				if(A[i].a > index)
				{
				maxjeho = A[i].souc;
				index  = i;
				}
			}
	}
	/*printf("sc %d %d\n",sc[0],sc[1]);*/
	int hrabli = 0;
	if(maxjeho >= (sc[0] - sc[1]))
	{
		/*hrabnem mu tam*/
	for(i=0;i<N;i++)
	{
		if((A[i].ca == 'G')&&(A[i].cb == 'S'))
		{
			if((i==index)&&(!hrabli))
			{
				a+= A[i].a;
				hrabli=1;
				break;
			}
			else
			{
				b+=A[i].b;
			}
		}
		
	}
	who = 1;
	for(i=0;i<N;i++)
	{
		if((A[i].ca == 'G')&&(A[i].cb == 'G'))
		{
			if(!who)a+=A[i].a;
			else b+= A[i].b;
			who^=1;
		}
	}
		
		
	}
	else
	{
		/*naberem zbytek*/
		who = 0;
	for(i=0;i<N;i++)
	{
		if((A[i].ca == 'G')&&(A[i].cb == 'G'))
		{
			if(!who)a+=A[i].a;
			else b+= A[i].b;
			who^=1;
		}
	}
	for(i=0;i<N;i++)
	{
		if((A[i].ca == 'G')&&(A[i].cb == 'S'))
			b+= A[i].b;
	}
	
	}
}

int main()
{	
	while(1)
	{
		if(scanf("%d %d %d",&a,&b,&N)!=3)
			return 0;
		spocti();
		printf("%d %d\n",a,b);
	}
}