#include <bits/stdc++.h>
using namespace std;
#define int long long
long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return (res+1000000006)%mod;
}
const int mod = 1e9+7;
signed main(){
  int N,M;
  cin>>N>>M;
  int x = modpow(2,M,mod);
  if(x%2 == 0) cout<<x/2<<endl;
  else cout<<(x+mod)/2<<endl;
}