RT。

n, k = map(int, input().split())
s = str(' ' + input())
ans = 0

def dfs(now, cnt, val, num):
    print(ans)
    if now > n:
        if cnt == k:
            ans = val * num
        return None
    if cnt < k:
        dfs(now + 1, cnt + 1, val * (num * 10 + int(s[now])), 0)
    dfs(now + 1, cnt, val, num * 10 + int(s[now]))

dfs(1, 0, 1, 0)
print(ans)