A night-market noodle stall keeps a running ledger of every customer it serves, in order. The stall owner runs a loyalty scheme: counting every customer ever served at the stall (starting from the very first), whenever the running count of customers reaches a multiple of n, that customer's entire basket total is discounted by a fixed percentage; every other customer pays the full price. Each item in the stall's catalogue has a fixed unit price, identified by an item id.

Given the catalogue, the loyalty interval n and the discount percentage, and the sequence of baskets (one per customer, in the order they were served), compute the final amount billed to each customer, in order.

Input format

Line 1: three integers n discount m — n is the loyalty interval, discount is the percentage discount (0–100) applied to the whole basket for every n-th customer, m is the number of distinct items in the catalogue. Next m lines: two integers id price — one catalogue item's id and its unit price. Next line: one integer q — the number of customers to process, in serving order. Next q lines: each line describes one customer's basket, starting with an integer k (the number of (id, amount) entries in that basket), followed by k pairs of integers id amount, all on the same line. The same id may appear more than once within one basket. Every id referenced is guaranteed to appear in the catalogue.

Output format

Print q lines. The i-th line is the total amount billed to the i-th customer, formatted with exactly two digits after the decimal point.

Constraints

• 1 <= n <= 10^4
• 0 <= discount <= 100
• 1 <= m <= 200
• 1 <= id <= 10^5, all catalogue ids distinct
• 1 <= price <= 10^4
• 1 <= q <= 1000
• 1 <= k <= 50
• 1 <= amount <= 1000

3 10 2
1 5
2 3
3
2 1 2 2 1
1 2 2
1 1 1

13.00
6.00
4.50

1 50 1
7 100
2
1 7 1
1 7 1

50.00
50.00