/*
TASK:school
LANG:C++
*/

#include<iostream>
#include<algorithm>
using namespace std;

int min(int a,int b)
{
    return a>b?a:b;
}
short boy[10000], girl[10000];
int bp, gp;
int boys, girls;

int scoreB(int k)
{
    if(k<girls && k<boys) return boy[boys-k];
    else if(k>=boys) return boy[0];
    return boy[boys-(k+k-girls)];
}

int scoreG(int k)
{
    if(k<boys&& k<girls) return girl[girls-k];
    else if(k>=girls) return girl[0];
    return girl[girls-(k+k-boys)];
}

int main()
{
    int m,n,k;
    cin>>m>>n>>k;
    int t=m+n, p;
    char P;
    
    for(int i=0; i<t; i++)
    {
           cin>>p>>P;
           if(P=='B')
           {
               boys++;
               boy[bp++] = p;
           }
           else
           {
               girls++;
               girl[gp++]=p;
           }
    }
    
    sort(boy, boy+boys);
    sort(girl, girl+girls);
    //cout<<boys<<' '<<girls<<' ';
    cout<<scoreB(k)<<' '<<scoreG(k);
    cin.get(); cin.get();
    return 0;
}
