A city bike-share operator monitors k docking stations over the course of a day. Every station starts the day perfectly balanced, at a net tally of zero. Throughout the day the system logs a stream of events; each event names a station and a signed integer delta describing how that station's bike count changed relative to where it started (a positive delta means bikes accumulated there faster than they left, a negative delta means the opposite). Given all of the day's events and a surplus threshold t, the operator wants to identify every station whose final net tally is strictly greater than t — these are the stations that have built up too great a surplus and are candidates for having bikes physically redistributed elsewhere overnight.

Input format

• Line 1: two integers k t, the number of stations and the surplus threshold.
• The next k lines each contain stationId name: a distinct integer station identifier and the station's name (a non-empty string of letters, digits, and underscores, at most 20 characters, no spaces).
• The next line contains a single integer m, the number of events.
• The next m lines each contain stationId delta: the identifier of the affected station (guaranteed to be one of the identifiers listed above) and a nonzero integer delta.

Output format

First print a single integer c, the number of stations whose final tally is strictly greater than t. Then print c lines, one per such station sorted by increasing stationId, each containing stationId name tally where tally is that station's final net tally.

Constraints

• 1 <= k <= 1000
• -1000000000 <= t <= 1000000000
• 0 <= m <= 5000
• 1 <= stationId <= 1000000, and all stationId values are distinct
• -1000000 <= delta <= 1000000, and delta != 0

3 5
101 Riverside
102 Uptown
103 Marina
4
101 3
101 4
102 -2
103 10

2
101 Riverside 7
103 Marina 10

2 0
201 Eastgate
202 Westgate
2
201 -1
202 1

1
202 Westgate 1