In the event of technical difficulties with Szkopuł, please contact us via email at szkopul@fri.edu.pl.

If you are familiar with IRC chat, the support team is also reachable on PIRC network (`irc.pirc.pl`

) in `#szkopul`

channel. If you are not, just use email.

Please do not ask us things like "how to solve task XYZ?".

Please remember that the support team has to sleep sometimes or go to work in real life.

San Bytecisco is a beautifully situated coastal town. It consists of small, yet densely populated islands, numbered from to . Certain islands are connected with bridges, used for (bidirectional) road traffic. Each pair of islands can be connected with at most one bridge. The islands are connected in such a way that every island can be reached from every other by using the bridges only.

Byteasar and Bytie are going for a bike trip in San Bytecisco.
The will start their ride at the island no. 1.
They intend to visit every island, while passing along every bridge once
and ending the trip where it began, i.e., the island no. 1.
Being quite seasoned riders, they expect some serious trouble from... the wind!
After all, it is very windy along the coast, and especially so on the bridges between
the islands. Obviously, depending on its speed and direction, the wind makes it
hard to cross the bridge *in different extent for either direction*.
For simplicity we will assume for every bridge and direction of crossing,
the opposing wind speed is constant.

Help Byteasar and Bytie to find a route as they desire that will in addition be the least tiresome. Byteasar and Bytie agreed on the maximum opposing wind speed as a measure of a route's tiresomeness.

In the first line of the standard input there are two integers separated by a single space: and (, ), denoting the number of islands and the number of bridges in San Bytecisco respectively. The islands are numbered from 1 to , while the bridges from 1 to . The following lines specify the bridges. The line no. contains four integers , , , (, , ), separated by single spaces. These denote that the bridge no. connects the islands no. and . The opposing wind speeds are when one goes moves from to , and if one goes from to .

If there is no route satisfying the requirements of the daring two riders,
the first and only line of the standard output should hold the word `NIE`
(*no* in Polish).
Otherwise, the output should have two lines, specifying the least tiresome route
over San Bytecisco.
The first line should hold the maximum opposing wind speed for that route, i.e.,
the number we wish to minimize.
The second line should hold integers, separated by single spaces, giving
the numbers of successive bridges one crosses on the least tiresome route.

Should there be more than one least tiresome route, your program can pick one arbitrarily.

For the input data:

4 4 1 2 2 4 2 3 3 4 3 4 4 4 4 1 5 4

the correct result is:

4 4 3 2 1

**Explanation of the example:**
The optimum route for Byteasar and Bytie is the following one:
.
The maximum opposing wind speed on that route is .

*Task authors: Szymon Acedanski, Jakub Radoszewski.*