/*
TASK:school
LANG:C++
*/
#include <iostream>
//#include <queue>
using namespace std;
int n,m,k,i,brb,brg,ost,min,min2,g[10000],b[10000],a;
char ch;    
int main()
{
    int min=0;
    cin>>n>>m>>k;
    for (i=0;i<n;i++)
        {
        cin>>a;
        cin>>ch;
        if (ch=='G')
           g[brg++]=a;
        else
            b[brb++]=a;
        }
    for (i=0;i<m;i++)
        {
        cin>>a;
        cin>>ch;
        if (ch=='G')
           g[brg++]=a;
        else
            b[brb++]=a;
        }
    sort(g,g+brg);
    sort(b,b+brb);
    if (brb<k) {min=b[0];ost=k-brb;min2=g[brg-(ost+k)];}
    else
        if (brg<k) {min2=g[0];ost=k-brg;min=b[brb-(ost+k)];}
    else
        {min=b[brb-k];min2=g[brb-k];}
    cout<<min<<' '<<min2<<endl;
    return 0;
}
