#include <bits/stdc++.h>
using namespace std;
#define MXN 1010
struct sStudent{ char n[25]; int g = 0;} s[MXN];
bool cmp(sStudent a,sStudent b){
if(a.g==b.g){
return strcmp(a.n,b.n)<0;
}
else
return a.g>b.g;
};
int main(){
int cnt, N, M, m, G, g, ms[15];
while(scanf("%d", &N), N){
scanf("%d %d", &M, &G);
for(int i = 1; i <= M; i++) scanf("%d",&ms[i]);
cnt = 0;
for(int i = 1; i <= N; i++){
s[i].g = 0;
scanf("%s %d", s[i].n, &m);
for(int k = 1; k <= m; k++)
scanf("%d", &g), s[i].g += ms[g];
if(s[i].g >= G) cnt++;
}
sort(s+1, s+N+1,cmp);
printf("%d\n", cnt);
for(int i = 1; i <= N && s[i].g >= G; i++)
printf("%s %d\n", s[i].n, s[i].g);
}
return 0;
}
10-13