#include<iostream>
#include<map>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
struct stu{
string name;
int mid;
int finaltest;
int coding;
int zoping;
stu()
{
mid=-1;
}
};
map<string,stu>mapp;
vector<stu> stulist;
bool cmp(stu a,stu b)
{
if(a.zoping==b.zoping)return a.name<b.name;
else return a.zoping>b.zoping;
}
int main()
{
string name;
stu now;
int p,m,n,i,temp,zoping;
float nowfloat;
cin>>p>>m>>n;
for(i=0;i<p;i++)
{
cin>>name>>temp;
mapp[name].coding=temp;
mapp[name].name=name;
}
for(i=0;i<m;i++)
{
cin>>name>>temp;
mapp[name].mid=temp;
mapp[name].name=name;
}
for(i=0;i<n;i++)
{
cin>>name>>temp;
mapp[name].finaltest=temp;
mapp[name].name=name;
}
for(map<string,stu>::iterator it=mapp.begin();it!=mapp.end();it++)
{
now=it->second;
if(now.coding>=200)
{
if(now.mid>now.finaltest)
{
nowfloat=0.4*now.mid+0.6*now.finaltest;
zoping=int(nowfloat+0.5);
}
else
{
zoping=now.finaltest;
}
if(zoping>=60)
{now.zoping=zoping;
stulist.push_back(now);}
}
}
sort(stulist.begin(),stulist.end(),cmp);
for(i=0;i<stulist.size();i++)
{
now=stulist[i];
cout<<now.name<<" "<<now.coding<<" "<<now.mid<<" "<<now.finaltest<<" "<<now.zoping<<endl;
}
return 0;
}