Wagle Wagle Soongkohan

Interview

Time limit1sMemory limit512 MB

Summary

Given three distinct participation values, print OK if their sum is 100 or more, otherwise print Soongsil, Korea, or Hanyang for the smallest.

Level: Easy2 of 10
Topics: Implementation, Array, Math, Brute force
Solved: No attempts yet

Problem

The Soongkohan Algorithm Camp is approaching, and even through vacation the universities keep collaborating. Even so, the organizers and instructors are busy with their own schedules, and the plans are gradually slipping. Changho, the head of the Soongkohan Algorithm Camp, decided to make a strict evaluation for efficient handling of the work.

Changho quantified the participation of the camp's member universities: Soongsil University, Korea University, and Hanyang University. In Changho's view, if the sum of the three universities' participation is 100 or more, the work is going well and he can rest easy, but if it is less than 100, Changho will put silent pressure on the club of the university with the lowest participation. Wish the Soongkohan Algorithm Camp success and resolve Changho's concern.

Input

The first line gives three natural numbers S, K, H, the participation of Soongsil University, Korea University, and Hanyang University, separated by spaces. (0 ≤ S, K, H ≤ 100)

The three universities' participation values are all different.

Output

If the work is going well and no silent pressure is needed, print “OK” (excluding the quotes) on the first line.

Otherwise, print on the first line the first word of the English name of the university that the club needing silent pressure belongs to. Follow the English spellings given in the statement.

Examples4

Example 1
Input
```
31 41 59
```
Expected output
```
OK
```
Example 2
Input
```
1 2 3
```
Expected output
```
Soongsil
```
Example 3
Input
```
19 8 9
```
Expected output
```
Korea
```
Example 4
Input
```
45 33 21
```
Expected output
```
Hanyang
```