/*
TASK:school
LANG:C
*/
#include<stdio.h>

int g[100],b[100];
int main(){
    int n,m,k,i,j,tmp,k2=0,k1=0,max,tmpn,flag=0;
    char tmp1,tmp2,tmp3;
    scanf("%d%d%d",&n,&m,&k);

    for(i=1;i<=n+m;i++){
                      scanf("%d%c%c",&tmp,&tmp3,&tmp2);
                      if(tmp2=='B'){b[k2]=tmp;k2++;}

                      if(tmp2=='G') {g[k1]=tmp;k1++;}}


    for(i=0;i<k2;i++){
                     max=b[i];
                     tmpn=i;
                     for(j=i+1;j<k2;j++)if(b[j]>max){max=b[j];tmpn=j;flag=1;}
                     if(flag==1){
                                 tmp=b[i];
                                 b[i]=max;
                                 b[tmpn]=tmp;
                                 flag=0;}}
    for(i=0;i<k1;i++){
                     max=g[i];
                     tmpn=i;
                     for(j=i+1;j<k1;j++)if(g[j]>max){max=g[j];tmpn=j;flag=1;}
                     if(flag==1){
                                 tmp=g[i];
                                 g[i]=max;
                                 g[tmpn]=tmp;
                                 flag=0;}}

    if(k2-1>=k&&k1-1>=k)printf("%d %d\n",b[k],g[k]);
    else if(k2-1<k)printf("%d %d\n",b[k2-1],g[k+k-k2-1]);
    else if(k1-1<k)printf("%d %d\n",b[k+k-k1-1],g[k1-1]);
    return 0;}



    
    
    
    
         
                      
