/*
TASK:school
LANG:C++
*/
#include<iostream>
using namespace std;
int main()
{
    long int m,n,k,d[20000],e[20000],boys[100000],girls[100000],br=0,br1=0,br2=0,change,x=0,z=0,h=0,u=0;
    char ch,ch1;
    cin>>n>>m>>k;
    do
    {
                 cin>>e[br]>>ch;
                 if(ch=='G') { girls[br1]=e[br]; br1++;}
                 if(ch=='B') { boys[br2]=e[br]; br2++;}
                 br++;
    }
    while(br!=n);
    br=0;
    do
    {
         cin>>d[br]>>ch1;
         if(ch1=='G') { girls[br1]=d[br]; br1++;}
         if(ch1=='B') { boys[br2]=d[br]; br2++;}
         br++;
    }
    while(br!=m);
    for(int i=0;i<=br1-1;i++)
     for(int j=0;j<=br1-1;j++)
      if(girls[i]>girls[j])
       {
        change=girls[j];
        girls[j]=girls[i];
        girls[i]=change;                           
       }
       
    for(x=0;x<=br2-1;x++)
     for(z=0;z<=br2-1;z++)
      if(boys[x]>boys[z])
       {
        change=boys[z];
        boys[z]=boys[x];
        boys[x]=change;                           
       }
    for(int y=0;y<=k-1;y++)
     for(int a=y+1;a<=k-1;a++)
      if(boys[y]==boys[a]) h++;
      
    for(int p=0;p<=k-1;p++)
     for(int o=o+1;o<=k-1;o++)
      if(girls[p]==girls[o]) u++;                 

    if((br2-1)<k-1) cout<<boys[br2-1];
    else cout<<boys[k+h-1]<<" ";
    if((br1-1)<k-1) cout<<girls[br1-1];
    else cout<<girls[k+u-1];

    return 0;
}
