#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
from queue import PriorityQueue
import bisect
import heapq
import numpy as np


def input():
    return sys.stdin.readline()[:-1]

sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """5 10
# """
# sys.stdin = io.StringIO(_INPUT)

MOD = 1000000007

def main():
    P, K = map(int, input().split())
    
    A = np.matrix([[P+1, 2], [P-1, 2*P-2]])
    M = A
    An = np.identity(M.shape[0], dtype=object)
    while K > 0:
        if K & 1 > 0:
            An = An * M % MOD
        M = M * M % MOD
        K >>= 1
    print(An[0, 0])

    # dp0 = [0 for _ in range(K+1)]
    # dp1 = [0 for _ in range(K+1)]
    # dp0[0] = 1
    # dp1[0] = 0
    # for i in range(K):
    #     dp0[i+1] = (dp0[i] * (P+1) + dp1[i] * 2) % MOD
    #     dp1[i+1] = (dp0[i] * (P-1) + dp1[i] * (2*(P-1))) % MOD

    # print(dp0[K])

if __name__ == '__main__':
    main()