K-кузнечик

n, k = map(int,input().split())
dp = [0] * 33
dp[1] = 1

for i in range(2, n+1):
    dp[i] = 0
    for j in range(1, min(k, i) + 1):
        dp[i] += dp[i-j]

print(dp[n])