#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<ll,ll>; #define rep(i, n) for(int i = 0; i < n; i++) #define all(x) (x).begin(),(x).end() template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;} template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;} ll MOD = 1000000007; ll mpow(ll x, ll y){ ll res = 1; x %= MOD; while(y){ if(y%2) res = res * x % MOD; x = x * x % MOD; y /= 2; } return res; } int main(){ ll n,m; cin >> n >> m; ll x = mpow(2,m-1); cout << (x*2-1)%MOD*mpow(2,MOD-2)%MOD << endl; return 0; }