import math

A, B = map(int, input().split())

def max_coins_on_perimeter(R, B_val):
    if B_val == 0:
        return 0
    if B_val > R:
        return 0
    low = 1
    high = 10**18
    ans = 0
    while low <= high:
        mid = (low + high) // 2
        theta = math.pi / mid
        if R * math.sin(theta) >= B_val:
            ans = mid
            low = mid + 1
        else:
            high = mid - 1
    return ans

if B > A:
    print("K")
elif A < 3 * B:
    print("S")
else:
    R = A - B
    # Calculate max coins around with center
    n = max_coins_on_perimeter(R, B)
    N1 = 1 + n
    # Calculate max coins around without center
    m = max_coins_on_perimeter(R, B)
    N2 = m
    maxN = max(N1, N2)
    print("S" if maxN % 2 == 1 else "K")