problem_num = gets.to_i
star_table = gets.split.map(&:to_i)

problem_table = {}
problem_num.times do |n|
  problem_table[(n+65).chr] = 1
end

score = Hash.new { |a, b| a[b] = Hash.new { |c, d| c[d] = 0 } }
score_total = Hash.new { |c, d| c[d] = 0 }
submit_order = {}

submit_num = gets.to_i
submit_num.times do |n|
  tmp = gets.split
  score[tmp[0]][tmp[1]] = (star_table[tmp[1].ord - 65] * 50 + 50 * star_table[tmp[1].ord - 65] / (0.8 + 0.2 * problem_table[tmp[1]])).floor
  score_total[tmp[0]] = score_total[tmp[0]] + score[tmp[0]][tmp[1]]
  submit_order[tmp[0]] = n
  problem_table[tmp[1]] += 1
end

score_total_desc = score_total.sort { |(k1, v1), (k2, v2)| v2 <=> v1 }

score_order = {}
score_total_desc.each_with_index do |(k1, v1), n1|
  num = 1
  score_total_desc.each_with_index do |(k2, v2), n2|
    if n1+1 != submit_order.size then
      if k1 == k2 then
        next
      else
        score_order[k1] = num
      end
    end

    if v1 < v2 then
      num += 1
      next
    elsif v1 > v2 then
      score_order[k1] = num
      break
    elsif  v1 == v2 then
      if submit_order[k1] > submit_order[k2] then
        num += 1
      end
    end
  end
  score_order[k1] = num
end

score_order_asc = score_order.sort { |(k1, v1), (k2, v2)| v1 <=> v2 }

ans = []
score_order_asc.each do |k, v|
  line = v.to_s + " " + k + " "
  problem_table.each_key do |t|
    line += score[k][t].to_s + " "
  end
  line += score_total[k].to_s
  ans << line
end

ans.each do |a|
  puts a
end