eolymp
bolt
Try our new interface for solving problems
Problems

Sorting time

Sorting time

Time limit 1 second
Memory limit 128 MiB

Sort the time according to the specified criteria.

Input data

The first line contains the number n~(1 \le n \le 100). Then n times are given. Each time is given as three integers — hours (0 to 23), minutes (0 to 60), and seconds (from 0 to 60).

Output data

Print the times, sorted in nondecreasing order (time is also displayed in the form of three numbers, do not print the leading zeros).

Examples

Input example #1
4
10 20 30
7 30 00
23 59 59
13 30 30
Output example #1
7 30 0
10 20 30
13 30 30
23 59 59