/*
TASK:school
LANG:C++
*/
#include<iostream>
#include<algorithm>
using namespace std;
int b[10001],g[10001],b1,g1;
int main()
{
 int n,m,k,i,a,kb,kg;
 char p;
 cin>>n>>m>>k;
 kb=kg=k;
 for(i=0;i<n+m;i++)
 {
  cin>>a>>p;
  if(p=='B'){b[b1]=a;b1++;}
  if(p=='G'){g[g1]=a;g1++;}
 }
 sort(b,b+b1);
 sort(g,g+g1);
 if(b1<k)
 {
  kb=b1;
  kg+=k-kb;
 }
 if(g1<k)
 {
  kg=g1;
  kb+=k-kg;
 }
 cout<<b[b1-kb]<<" "<<g[g1-kg]<<endl;
 system("PAUSE");
 return 0;
}
