BOJ 17388 와글와글 숭고한

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 1234567890
#define N 200000

const int LIMIT = 1e+9;
int n, m;
ll powf(ll base, ll exp) {
	ll res = 1;
	while (exp) {
		if (exp & 1)
			res *= base;
		exp >>= 1;
		base *= base;
	}
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int a, b, c;
	cin >> a >> b >> c;
	if (a + b + c >= 100) {
		cout << "OK";
	}
	else {
		int min_value = min({ a, b, c });
		if (min_value == a) {
			cout << "Soongsil";
		}
		else if (min_value == b) {
			cout << "Korea";
		}
		else {
			cout << "Hanyang";
		}
	}

	return 0;
}