import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


P, K = map(int, input().split())
mod = 10 ** 9 + 7

dp = [[0, 0] for _ in range(K + 1)]
dp[0][0] = 1
for i in range(K):
    dp[i + 1][0] += dp[i][0] * (P + 1) + dp[i][1] * 2
    dp[i + 1][1] += dp[i][0] * (P - 1) + dp[i][1] * (2 * P - 2)
    dp[i + 1][0] %= mod
    dp[i + 1][1] %= mod
print(dp[K][0])