Race Results

Interview

Time limit1sMemory limit128 MB

Summary

Sort N finish times given as hours, minutes, and seconds in ascending order and print each on its own line.

Level: Easy3 of 10
Topics: Sorting, Implementation
Solved: No attempts yet

Problem

The herd has finished its first marathon! You are given $N$ finish times, each written as Hours $H$ , Minutes $M$ , and Seconds $S$ ( $1 \le N \le 5{,}000$ , $0 \le H \le 99$ , $0 \le M \le 59$ , $0 \le S \le 59$ ).

Sort these times in ascending order — comparing by hours, then minutes, then seconds, with the smallest (fastest) time first — and print them.

Input

Line 1: a single integer $N$ .
Lines 2 through $N+1$ : line $i+1$ contains the $i$ -th cow's time as three space-separated integers: hours, minutes, and seconds.

Output

$N$ lines: each line contains one cow's time as three space-separated integers (hours, minutes, seconds), printed in ascending sorted order.

Examples1

Example 1

Input

Expected output

11 15 12
11 20 20
14 20 14