Sorting times

You are given $n$ moments of a day as hours, minutes and seconds. Sort them in non-decreasing order.

The first line contains $n$ ($1 \le n \le 10^5$). Each of the next $n$ lines contains three integers: hours $h$ ($0 \le h \le 23$), minutes $m$ and seconds $s$ ($0 \le m, s \le 59$).

$n$ lines — the sorted moments in the same form as in the input (h m s, no leading zeros).

Moments are compared by hours first, then by minutes, then by seconds. Use either a comparator with three keys or turn every moment into a single number — $3600h + 60m + s$.

For $n = 10^5$ an $O(n^2)$ sort (bubble, selection) is too slow — use the built-in sort of your language.

Source: acmp.ru, problem 119.