In the event of technical difficulties with Szkopuł, please contact us via email at [email protected].

If you would like to talk about tasks, solutions or technical problems, please visit our Discord servers. They are moderated by the community, but members of the support team are also active there.

In a finite sequence of positive integers not greater than a billion, representing lengths of line segments, we want to find three numbers such that one can build a triangle from segments of such lengths.

Write a program which examines whether among the line segments - lengths of
which are written in the standard input - there exist three such that one can
build a triangle from them. If so, the program writes the lengths of those three
segments in the standard output. If there exist no such triple, the program
writes one word `NIE` ("*no*") in the file standard output.

If there exist many triples of line segments of lengths written in the standard input such that one can build a triangle from them, then your program should find and write only one (arbitrary) of them.

In the standard input there is a finite sequence of at least three positive integers not greater then , terminated by the number . Each number is written in a separate line. Positive numbers are lengths of line segments, and the number denotes the end of the data.

The data in the standard input are written correctly and your program need not verify that.

In the standard output there should be either one word `NIE`, or three
lengths of line segments chosen from the standard input, from which one can
build a triangle. The lengths are separated by single spaces.

For the input data:

105 325 55 12555 1700 0

the correct result is:

NIE

For the input data:

250 1 105 150 325 99999 73 0

the correct result is:

250 105 150

*Task author: Piotr Chrzastowski-Wachtel.*