Each year, a prestigious culinary circuit crowns one champion chef in each of four separate competitions: the Golden Spoon, the Iron Skillet, the Silver Ladle, and the Copper Whisk. A single chef may win more than one of the four titles in the same year, and a chef who has already won a title may go on to win more in later years.

Given the roster of chefs on the circuit and the champions crowned across several years, find the total number of championship titles each chef has won overall, summed across every competition and every year. Report only the chefs who have won at least one title, ordered from the most total titles to the fewest; break any tie in total titles by ordering those chefs alphabetically by name.

Input format

• Line 1: two integers Y and P, separated by a space — the number of years of results and the number of chefs on the roster.
• The next Y lines each contain four integers, separated by spaces: the 1-indexed roster positions of the chefs who won the Golden Spoon, Iron Skillet, Silver Ladle, and Copper Whisk that year, respectively (the same roster position may appear more than once on a single line).
• The next P lines each contain a single token: the name of the chef at that roster position (the first of these P lines names chef 1, the second names chef 2, and so on).

Output format

For every chef with at least one total title, print a line "name count" — the chef's name, a single space, and their total title count — ordered by count descending, then by name ascending among ties. Chefs with zero titles must not be printed.

Constraints

• 1 <= Y <= 1000
• 1 <= P <= 200
• Every roster position given in a year's line is between 1 and P, inclusive.
• Each chef name is a string of 1 to 20 letters and/or digits, and all P names are distinct.

2 3
1 2 1 3
2 2 3 1
OLIVER
PRIYA
KENJI

OLIVER 3
PRIYA 3
KENJI 2

1 3
1 1 1 1
ASHA
BEN
CARLA

ASHA 4