Time Cards

To improve productivity, a farmer gives each cow extra hay based on how long it spends at a milking machine, so every cow now uses a time card. When a cow starts at a machine she writes the start time on the master card, and when she leaves she writes the stop time. There are enough machines that every cow can be milked at the same time.

There are $N$ cows numbered $1 \ldots N$ ($1 \le N \le 145$) and $Nlines$ total entries ($1 \le Nlines \le 1458$). Each entry lists a cow number $C$ ($1 \le C \le N$), a keyword (START or STOP), and a time given as two integers $HH$ and $MM$ ($0 \le HH \le 23$, $0 \le MM \le 59$). Cows never stay at a machine past midnight, and every START entry has a matching STOP entry that appears later in the file.

Compute the total time each cow spends at the milking machine.

• Line 1: two space-separated integers $N$ and $Nlines$.
• Lines $2 \ldots Nlines+1$: each line has four space-separated values — $C$, the keyword (START or STOP), $HH$, and $MM$.

• Lines $1 \ldots N$: line $i$ contains two space-separated integers — the number of hours and the number of minutes that cow $i$ spent at the milking machine. The minutes value never exceeds 59.