181. Sorted Numbers
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
This problem is worth 5 points.

You like sequences of numbers that are in sorted order. You have three integers, and you want to figure out whether or not they're sorted, i.e. the first number is less than (not equal to) the second number, and the second number is less than (not equal to) the third number.

Input

The only line of input consists of three space-separated integers.

Output

If the three integers given are sorted, output "SORTED" (no quotes). Otherwise, output "UNSORTED".

Examples
Input
3 5 8
Output
SORTED
Input
6 6 7
Output
UNSORTED
Input
5 2 1
Output
UNSORTED