Gnome Sequencing

In the book All Creatures of Mythology, gnomes are kind, bearded creatures, while goblins tend to be bossy and simple-minded. The goblins like to harass the gnomes by making them line up in groups of three, ordered by the length of their beards. Because the gnomes come in different heights, they keep rearranging themselves to confuse the goblins, so the goblins have to measure each beard in centimeters to check whether a group is really lined up in order.

Write a program that helps the goblins decide, for each group, whether the three gnomes are lined up properly — that is, with beard lengths running either from shortest to longest or from longest to shortest.

The first line contains a single integer $N$ ($0 < N < 30$), the number of groups to process.

Each of the next $N$ lines contains three distinct positive integers less than $100$, the beard lengths of one group in the order the gnomes are standing.

First print the title line Gnomes:.

Then, for each group in order, print Ordered if its three beard lengths are strictly increasing or strictly decreasing, and Unordered otherwise.