Stack is a container of elements that are inserted and deleted according to LIFO (Last In First Out).
For $n$ stack $S_i$ ($i = 0, 1, ..., n-1$), perform a sequence of the following operations.
In the initial state, all stacks are empty.
The input is given in the following format.
$n \; q$ $query_1$ $query_2$ : $query_q$
Each query $query_i$ is given by
0 $t$ $x$
or
1 $t$
or
2 $t$
where the first digits 0, 1 and 2 represent push, top and pop operations respectively.
For each top operation, print an integer in a line.
3 9 0 0 1 0 0 2 0 0 3 0 2 4 0 2 5 1 0 1 2 2 0 1 0
3 5 2