A farming cooperative keeps its harvest records in a wide ledger: one line per plot, with a fixed set of crop columns holding that plot's harvest weight (in kilograms) for each crop. The cooperative is switching its inventory system to a format that expects one record per plot-crop pair instead of one wide row per plot. Write a program that expands the wide ledger into this per-pair record format.

Input format

• Line 1: two integers n and k, separated by a space — the number of plots and the number of crop columns.
• Line 2: k crop names, space-separated. Each crop name is a non-empty string of lowercase letters and digits (at most 20 characters); all crop names are distinct.
• The next n lines each describe one plot: a plot identifier (a non-empty string of lowercase letters and digits, at most 20 characters, distinct across all plots), followed by k integers giving that plot's harvest weight for each crop, in the same left-to-right order as the crop names on line 2.

Output format

Print exactly n * k lines. Process the plots in the order they appear in the input, and for each plot process its crops in the order the crop names appear in the header. For every (plot, crop) pair, print one line: <plot_id> <crop_name> <weight>, with a single space between the three fields.

Constraints

• 1 <= n <= 1000
• 1 <= k <= 20
• Every plot identifier is distinct; every crop name is distinct.
• Each weight is an integer with -1000000 <= weight <= 1000000 (harvest corrections can make a recorded weight negative).

2 3
wheat corn rice
p1 10 20 30
p2 5 0 15

p1 wheat 10
p1 corn 20
p1 rice 30
p2 wheat 5
p2 corn 0
p2 rice 15

1 2
soy oat
plot1 -3 7

plot1 soy -3
plot1 oat 7