//g++ 1.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

constexpr ll mod = 1e9+7;

bool ok(vvi &g){
  int n=g.size(),m=g[0].size();
  rep(i,0,n){
    bool flg=false;
    rep(j,0,m){
      if(g[i][j]==1){
        flg=true;
      }
    }

    if(flg==false){
      return flg;
    }
  }

  rep(j,0,m){
    bool flg=false;
    rep(i,0,n){
      if(g[i][j]==1){
        flg=true;
      }
    }

    if(flg==false){
      return flg;
    }
  }

  return true;
}

const int MAX=1510000;
const long long MOD=1000000007;

long long fac[MAX],finv[MAX],inv[MAX];

void COMinit(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i]=finv[i-1]*inv[i]%MOD;
  }
}

long long COM(int n,int k){
  if(n<k) return 0;
  if(n<0||k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int h,w;
  cin>>h>>w;

  /*
  int ans=0;
  vvi g(h,vi(w));

  rep(bit,0,(1<<(h*w))){
    rep(i,0,h){
      rep(j,0,w){
        g[i][j]=0;
        if(bit&(1<<(i*w+j))){
          g[i][j]=1;
        }
      }
    }

    ans+=ok(g);
  }

  cout<<ans<<endl;
  */

  COMinit();

  ll ans=0;
  rep(j,0,w+1){
    ll p=pow_mod(-1,j,mod);
    ll q=COM(w,j);
    ll r=pow_mod(2,w-j,mod)-1;
    r=pow_mod(r,h,mod);

    ans+=((p*q)%mod*r)%mod;
    ans=(ans%mod+mod)%mod;
  }

  cout<<ans<<endl;
}