#include <stdio.h>

const long long Mod = 1000000007;
long long fact[1000001], fact_inv[1000001];

long long combination(int n, int k)
{
	if (k < 0 || n < k) return 0;
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long pow_mod(int n, long long k)
{
	long long N, ans = 1;
	for (N = n; k > 0; k >>= 1, N = N * N % Mod) if (k & 1) ans = ans * N % Mod;
	return ans;
}

int main()
{
	int H, W;
	scanf("%d %d", &H, &W);
	if (H > W) {
		H ^= W;
		W ^= H;
		H ^= W;
	}
	
	int h;
	long long ans = 0, tmp;
	for (h = 1, fact[0] = 1; h <= H; h++) fact[h] = fact[h-1] * h % Mod;
	for (h = H - 1, fact_inv[H] = div_mod(1, fact[H], Mod); h >= 0; h--) fact_inv[h] = fact_inv[h+1] * (h + 1) % Mod;
	for (h = 0; h <= H; h++) {
		if (h % 2 == 0) ans += combination(H, h) * (pow_mod(pow_mod(2, H - h) - 1, W)) % Mod;
		else ans += Mod - combination(H, h) * (pow_mod(pow_mod(2, H - h) - 1, W)) % Mod;
	}
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}