package m.shin;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.TreeMap;
public class Con628 {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int N = s.nextInt();
		TreeMap<String , Integer> tag = new TreeMap<>();
		for(int i = 0;i < N;i++){
			s.nextInt();
			int M = s.nextInt() , point = s.nextInt();
			for(int j = 0;j < M;j++){
				String str = s.next();
				if(tag.get(str) == null){
					tag.put(str, point);
				}else{
					tag.put(str, tag.get(str)+point);
				}
				//System.out.println(str + "   " + tag.get(str));
			}
		}
		s.close();

		int size = tag.size();
		TreeMap<Integer , String> ans = new TreeMap<>();
		for(int i = 0;i < size;i++){
			Entry<String , Integer> ent = tag.pollFirstEntry();
			int j = 9;
			while(ans.get(ent.getValue()*10 + j) != null){
				j--;
			}
			ans.put(ent.getValue()*10 + j, ent.getKey());
		}

		for(int i = 0;i < Math.min(size, 10);i++){
			Entry<Integer , String> ent = ans.pollLastEntry();
			System.out.println(ent.getValue() + " " + ent.getKey()/10);
		}

	}

}