#include <stdio.h>
#include <memory.h>
#include <math.h>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <map>#define I scanf
#define OL puts
#define O printf
#define F(a,b,c) for(a=b;a<c;a++)
#define FF(a,b) for(a=0;a<b;a++)
#define FG(a,b) for(a=b-1;a>=0;a--)
#define LEN 501
#define MAX 0x06FFFFFFusing namespace std;typedef struct Student{string name;int gp,gm,gf,G;Student(){gp=0,gm=0,gf=0,G=0;}Student(string n,int p,int m,int f,int g){name=n;gp=p,gm=m,gf=f,G=g;}bool operator < (Student const & o)const{if(G<o.G) return true;else if(G==o.G) return name<o.name;}
}Student;
Student output[10000];#define MAP map<string,Student*>MAP info;
bool cmp(Student a,Student b);int main() {freopen("d:/input/A1137.txt","r",stdin);int P,M,F,t;char buffer[1000];scanf("%d %d %d",&P,&M,&F);while(P-->0){I("%s",buffer);scanf("%d",&t);string name(buffer);MAP::iterator it=info.find(name);Student * tmp;if(it==info.end()){tmp=new Student;tmp->gp=t;tmp->name=name;info[name]=tmp;}else{tmp=it->second;tmp->gp=t;}}while(M-->0){I("%s",buffer);scanf("%d",&t);string name(buffer);MAP::iterator it=info.find(name);Student * tmp;if(it==info.end()){tmp=new Student;tmp->gm=t;tmp->name=name;info[name]=tmp;}else{tmp=it->second;tmp->gm=t;}}while(F-->0){I("%s",buffer);scanf("%d",&t);string name(buffer);MAP::iterator it=info.find(name);Student * tmp;if(it==info.end()){tmp=new Student;tmp->gf=t;tmp->name=name;info[name]=tmp;}else{tmp=it->second;tmp->gf=t;}}int n,i=0;MAP::iterator it=info.begin();while(it!=info.end()){Student * p=it->second;int gp,gm,gf,G;gp=p->gp;gm=p->gm,gf=p->gf;string name=p->name;if(!(gp<200 || gf<60 || gf >100)){if(gm==0) gm=-1;if(gf>=gm) G=gf;else{G=round(0.4*(double)gm+0.6*(double)gf);}output[i++]=Student(name,gp,gm,gf,G);}it++;}n=i;sort(output,output+n,cmp);FF(i,n){O("%s %d %d %d %d\n",output[i].name.c_str(),output[i].gp,output[i].gm,output[i].gf,output[i].G);}return 0;
}bool cmp(Student a,Student b){if(a.G>b.G) return true;else if(a.G==b.G) return a.name<b.name;return false;
}