#!/usr/bin/env pypy3

import collections
import heapq
import itertools
import string


def sub_score(level, ac_pos):
    return 50 * level + 500 * level // (8 + 2 * ac_pos)


def main():
    num_probs = int(input())
    ls = dict(zip(string.ascii_uppercase, (int(l) for l in input().split())))
    num_subs = int(input())
    ac_pos = collections.defaultdict(lambda: 1)
    total_score = collections.defaultdict(int)
    each_score = collections.defaultdict(lambda: collections.defaultdict(int))
    pq = []
    for i in range(num_subs):
        name, p = input().split()
        s = sub_score(ls[p], ac_pos[p])
        each_score[name][p] = s
        total_score[name] += s
        ac_pos[p] += 1
        heapq.heappush(pq, (-total_score[name], i, name))
    processed = set()
    j = 0
    while pq:
        total, _, name = heapq.heappop(pq)
        if name not in processed:
            j += 1
            processed.add(name)
            total = -total
            g = (each_score[name][x] for x in
                 string.ascii_uppercase[:num_probs])
            print(j, name, *itertools.chain(g, (total, )))


if __name__ == '__main__':
    main()