def count_partitions(n, r):
MOD = 10007
dp = [[0] * (r + 1) for _ in range(n + 1)]
dp[0][0] = 1 # 初始化，没有元素划分为0个子集的方法只有一种

for i in range(1, n + 1):
    for j in range(1, min(i, r) + 1):
        dp[i][j] = (j * dp[i - 1][j] + dp[i - 1][j - 1]) % MOD

return dp[n][r]

读取输入

n, r = map(int, input().split())

计算并输出结果

print(count_partitions(n, r))