Problem Statement

Takahashi, a pastry chef at ABC Confiserie, has decided to make cakes to celebrate AtCoder Beginner Contest 200.

A cake made by Takahashi has three parameters: beauty, taste, and popularity, each of which is represented by an integer between $1$ and $N$ (inclusive).

He has made a cake of beauty $i$, taste $j$, and popularity $k$ for every triple $(i,j,k)(1\le i,j,k\le N)$.
Then, he has arranged these N3 cakes in a row, as follows:

• The cakes are in ascending order of sum of beauty, taste, and popularity from left to right.
• For two cakes with the same sum of beauty, taste, and popularity, the cake with the smaller beauty is to the left.
• For two cakes with the same sum and the same beauty, the cake with the smaller taste is to the left.

Find the beauty, taste, and popularity of the $K$-th cake from the left.

Constraints

• All values in input are integers.
• 1≤N≤106
• 1≤K≤N3

Sample Input 1

2 5

Sample Output 1

1 2 2

The cakes are in the following order:

$(1,1,1),(1,1,2),(1,2,1),(2,1,1),(1,2,2),(2,1,2),(2,2,1),(2,2,2)$.

Here, each triple of integers represents the beauty, taste, and popularity of a cake.

Sample Input 2

1000000 1000000000000000000

Sample Output 2

1000000 1000000 1000000

The values in input may be large.

Sample Input 3

9 47

Sample Output 3

3 1 4