import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

def nCr(com_n, com_r):
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md

# 準備
n_max = 10005
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md
inv = [0]
for i in range(1, n_max): inv.append(pow(i, md-2, md))

n, k = MI()
n += 1
pw = [1]
for _ in range(n_max): pw.append(pw[-1]*n%md)
bb = [1, 500000003]+[0]*(k+1)
for i in range(2, k+3, 2):
    s = 0
    for j in range(i):
        s += nCr(i+1, j)*bb[j]
        s %= md
    bb[i] = s*-inv[i+1]%md
# print(bb)

ans = 0
for i in range(k+1):
    ans += nCr(k+1, i)*bb[i]*pw[k-i+1]
    ans %= md
ans = ans*inv[k+1]%md
print(ans)