A logistics company tracks crate specifications and how many of each crate type sit in every one of its freight yards. Each crate type has a fixed width, length, and height (its dimensions never change), while every yard independently records how many units of a crate type it currently holds. Given the catalog of crate dimensions and the list of (yard, crate type, unit count) storage records, compute for every yard mentioned in the records the total volume of everything stored there: the sum, over every record for that yard, of (units stored) x (crate's width x length x height). Report this total for each distinct yard, in ascending alphabetical order of the yard's name.

Input format

Line 1 contains a single integer n, the number of crate types. Each of the next n lines contains four space-separated integers: a crate id pid (unique per crate type), and w, l, h -- the crate's width, length, and height. The next line contains a single integer m, the number of storage records. Each of the next m lines contains a yard name (a single token with no whitespace), followed by a crate id pid (guaranteed to appear in the catalog above) and an integer units, the number of that crate type currently stored in that yard.

Output format

Let k be the number of distinct yard names appearing in the storage records. Print k lines, sorted by yard name in ascending lexicographic order. Each line contains the yard name followed by a single space and the yard's total stored volume, computed as described above.

Constraints

• 1 <= n <= 1000
• 1 <= pid <= 10^6, all crate ids in the catalog are distinct
• 1 <= w, l, h <= 1000
• 1 <= m <= 1000
• 1 <= units <= 1000
• Yard names consist of 1 to 20 lowercase English letters and/or digits; the same yard name may appear in multiple storage records (even for the same crate type), in which case the amounts add up

2
1 5 10 2
2 3 3 3
3
yardA 1 2
yardB 2 1
yardA 2 1

yardA 227
yardB 27

1
7 2 2 2
3
z1 7 5
a9 7 3
z1 7 1

a9 24
z1 48