Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

Unknown Language Round #1:

- ActiveTcl 8.5

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Presents

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputYou 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.

Input

The only line contains three integer numbers *a*_{1}, *a*_{2}, *a*_{3} (1 ≤ *a*_{1}, *a*_{2}, *a*_{3} ≤ 100) — the prices of the presents.

Output

Print three numbers *i*_{1}, *i*_{2}, *i*_{3} (1 ≤ *i*_{1}, *i*_{2}, *i*_{3} ≤ 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.

Examples

Input

11 13 1

Output

2 1 3

Input

30 10 30

Output

1 3 2

Note

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

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/15/2019 17:21:59 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|