#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)

//return x^y (mod z)
ll my_pow(ll x,ll y,ll z){
	if(x==0) return 0;
	if(y==0) return 1;
	if(y%2==1) return (x*my_pow(x,y-1,z))%z;
	return my_pow((x*x)%z,y/2,z);
}

namespace po167{
struct combination{
	std::vector<long long> fact;
	std::vector<long long> rev;
	std::vector<long long> fact_rev;
	long long MOD;
	combination(int max,long long mod):MOD(mod),fact(max+1),rev(max+1),fact_rev(max+1){
		for(long long i=0;i<=max;i++){
			if(i<2){
				fact[i]=1;
				fact_rev[i]=1;
				rev[i]=1;
				continue;
			}
			fact[i]=(fact[i-1]*i)%mod;
			rev[i]=mod-((mod/i)*rev[mod%i])%mod;
			fact_rev[i]=(fact_rev[i-1]*rev[i])%mod;
		}
	}
	long long Comb(int x,int y){
		if (x<y||y<0) return 0;
		return (((fact_rev[y]*fact_rev[x-y])%MOD)*fact[x])%MOD;
	}
};
}
using po167::combination;

void solve(int H,int W);

//おちこんだりもしたけれど、私はげんきです。
int main() {

	int H,W;
	cin>>H>>W;
	assert(1<=H&&H<=(int)(1e6));
	assert(1<=W&&W<=(int)(1e6));
	solve(H,W);
}

void solve(int H,int W){
	combination C(H,mod);
	ll ans=0;
	ll tmp=1;
	ll sign=1;
	if((H+W)%2) sign=-1;
	rep(i,H+1){
		ans+=sign*(C.Comb(H,i)*my_pow(1-tmp,W,mod))%mod;
		ans%=mod;
		tmp*=2;
		tmp%=mod;
		sign*=-1;
	}
	cout<<(ans+mod)%mod<<"\n";
}