#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include <unordered_set>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;

ll mod_pow(ll x,ll y,ll mod){
    x%=mod;
    ll res=1;
    while(y>0){
        if(y&1){
            res*=x;
            res%=mod;
        }
        x*=x;
        x%=mod;
        y/=2;
    }
    return res;
}

ll gcd(ll x,ll y){
    return y==0?x:gcd(y,x%y);
}

int main(){

    ll N,M;
    cin>>N>>M;

    ll inv2=mod_pow(2,MOD-2,MOD);


    ll c=(mod_pow(2,M,MOD)-1+MOD)%MOD;

    ll ans=c*inv2%MOD;
    cout<<ans<<endl;




}