#P64D. Presents

    ID: 2058 Type: RemoteJudge 2000ms 64MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>*special problemgreedy*1800

Presents

No submission language available for this problem.

Description

You are given the prices of three presents. Also there are three sisters. It is known that the most valuable present is for the eldest sister. The second (by price) is for the second sister. And the less valuable present is for the youngest sister. If two (or three) presents have the same price, corresponding sisters may get the in a random way.

The only line contains three integer numbers a1, a2, a3 (1 ≤ a1, a2, a3 ≤ 100) — the prices of the presents.

Print three numbers i1, i2, i3 (1 ≤ i1, i2, i3 ≤ 3), all of them should be distinct. The first number stands for the seniority of the sister which will get the first present (1 stands for the eldest, 3 for the youngest). The second and third numbers mean the seniority of the sisters which get the second and the third present respectively.

If there are multiple answers, print any of them.

Input

The only line contains three integer numbers a1, a2, a3 (1 ≤ a1, a2, a3 ≤ 100) — the prices of the presents.

Output

Print three numbers i1, i2, i3 (1 ≤ i1, i2, i3 ≤ 3), all of them should be distinct. The first number stands for the seniority of the sister which will get the first present (1 stands for the eldest, 3 for the youngest). The second and third numbers mean the seniority of the sisters which get the second and the third present respectively.

If there are multiple answers, print any of them.

Samples

11 13 1

2 1 3
30 10 30

1 3 2

Note

In the second sample another possible answer is "2 3 1".