/*
TASK:school
LANG:C++
*/
#include<iostream>
using namespace std;
int b[10001],g[10001];
int f(int x,int y)
{
         return x>y;
}
int main()
{
    int i,m,n,k,cb=-1,cg=-1,j;
    char x;
    cin>>m>>n>>k;
    for(i=0;i<m;i++)
    {
      cin>>j>>x;
      if(x=='B')
      {
        cb++;
        b[cb]=j;
      }
      else
      {
          cg++;
          g[cg]=j;
      }
    }
    for(i=0;i<n;i++)
    {
      cin>>j>>x;
      if(x=='B')
      {
        cb++;
        b[cb]=j;
      }
      else
      {
          cg++;
          g[cg]=j;
      }
    }
    sort(b,b+cb+1,f);
    sort(g,g+cg+1,f);
    k-=1;
    int pb,pg,tb,tg;
    if(k<=cb)
     tb=0;
    else
     tb=1;
    if(k<=cg)
     tg=0;
    else
     tg=1;
    if(!tb)
    {
      pb=k;
      if(!tg)
        pg=k;
      else
      {
        pb+=k-cg;
        pg=cg;
      }
    }
    else
    {
      pb=cb;
      if(!tg)
      {
        pg=k+k-cb;
      }
      else
        pg=cg;
    }
    cout<<b[pb]<<" "<<g[pg]<<endl;
    return false;
}
