t = int(input())
n, k = 0, 0
s = ''

d = 10


def solve():
    len0 = n // (k + 1)
    pos0 = [len0 * i + len0 - 1 for i in range(k)]
    dp = [[-1 for i in range(d * 2)] for _ in range(k)]
    for i in range(k):
        if i == 0:
            for j in range(d * 2):
                p1 = pos0[i] + (j - d)
                if p1 < 0 or p1 >= n:
                    continue
                dp[i][j] = int(s[0: p1 + 1])
            continue
        for j in range(d * 2):
            for pre_j in range(d * 2):
                p1 = pos0[i] + (j - d)
                pre_p1 = pos0[i - 1] + (pre_j - d)
                if p1 < 0 or p1 >= n:
                    continue
                if pre_p1 < 0 or pre_p1 >= n:
                    continue
                if not pre_p1 < p1:
                    continue
                if dp[i - 1][pre_j] == -1:
                    continue
                temp = dp[i - 1][pre_j] + int(s[pre_p1 + 1: p1 + 1])
                # dp[i][j] = temp if dp[i][j] == -1 or temp < dp[i][j] else -1
                if dp[i][j] == -1:
                    dp[i][j] = temp
                else:
                    dp[i][j] = min(dp[i][j], temp)
    ans = -1
    for pre_j in range(d * 2):
        pre_p1 = pos0[len(pos0) - 1] + (pre_j - d)
        if pre_p1 < 0 or pre_p1 >= n - 1:
            continue
        if dp[k - 1][pre_j] == -1:
            continue
        temp = dp[k - 1][pre_j] + int(s[pre_p1 + 1:])
        if ans == -1:
            ans = temp
        else:
            ans = min(ans, temp)

    # for i in range(k):
    #     print(dp[i])
    print(ans)


for _ in range(t):
    ins = input().split(' ')
    n, k = int(ins[0]), int(ins[1])
    s = input()
    solve()


'''
1
8 1
45455151
'''