pythondef solve(N, K, SS):
from collections import Counter
c = Counter(SS).most_common()
K -= 1
ck, ckv = c[K]
if K > 0:
_, pv = c[K - 1]
if pv == ckv:
return "AMBIGUOUS"
if K < len(c) - 1:
_, pv = c[K + 1]
if pv == ckv:
return "AMBIGUOUS"
return ck