Boat Commuter

The Bulgarian city of Nodnol runs a boat service to ferry its residents between the trendy areas where they live and the large metallic structures where they work on the next recession.

TFN (Transport For Nodnol) has issued $m$ travel cards, known affectionately as "Retsyo", numbered from $1$ to $m$. Each pier has a card terminal where passengers tap "in" when starting a trip and tap "out" when finishing it.

Since each pier has only one card terminal, passengers use the same device to tap in and to tap out.

The cost of a trip depends on the distance travelled:

• if the trip started at pier $i$ and finished at pier $j$ ($i \ne j$), its cost is $|i-j|$ pounds;
• if the trip started somewhere but was not finished with a tap out, it costs £100;
• if the trip started and finished at the same pier, it also costs £100, because it is treated as an attempt to game the system.

You are given a sequence of tapping events. For each event, the pier $p_i$ and the card number $c_i$ are recorded. Determine how much the transport authority should charge each card.

• One line containing three integers: the number of piers $n$, the number of travel cards $m$, and the number of events $k$ ($2 \le n \le 50$, $1 \le m, k \le 10^5$).
• $k$ further lines, each describing a tap event in chronological order.
  • The $i$-th event is described by two integers $p_i$ and $c_i$ ($1 \le p_i \le n$, $1 \le c_i \le m$).

Output $m$ integers separated by spaces. The $i$-th integer is the total charge for the $i$-th card.