A yacht club runs a season-long regatta in which m boats compete across n legs. After every leg, officials record each boat's whole-number point total for that leg on a scoreboard: one row per boat, one column per leg. Before publishing the results, the race committee wants the scoreboard reprinted so the boats appear from the highest score to the lowest score on one particular leg, while each boat's entire row of per-leg scores stays intact and moves together as a single block — only the row order changes, never the values inside a row.

Input format

• The first line contains three integers m, n, and k — the number of boats, the number of legs, and the (0-indexed) leg to rank by.
• Each of the next m lines contains n integers, the j-th of which is the score the boat earned on leg j.

Output format

Print m lines. The i-th line must contain the n scores of whichever boat ranks i-th when all boats are ordered by non-increasing score on leg k. Every printed row must reproduce one of the input rows exactly, in full, with only the row order changed.

Constraints

• 1 <= m, n <= 100
• 0 <= score[i][j] <= 100
• 0 <= k <= n - 1
• The values in column k are pairwise distinct across all boats, so the ranking on leg k is never tied.

3 3 0
6 7 8
3 5 9
5 8 4

6 7 8
5 8 4
3 5 9

2 2 1
3 1
2 3

2 3
3 1