H, W = map(int, input().split())
mod = 10 ** 9 + 7
n = 1010101

fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod


ans = 0
pm = 1
for i in range(W, -1, -1):
    ans += pow(pow(2, i, mod) - 1, H, mod) * pm * comb(W, i)
    ans %= mod
    pm *= -1
    
print(ans)