#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
int a[15][15];
int n,m;
void solve(){
    int cnt=0;
    for(int i=0;i<(1<<(n*m));i++){
        for(int j=0;j<n*m;j++){
            a[j/m][j%m]=(i>>j)&1;
        }
        bool fl=1;
        for(int j=0;j<n;j++){
            int c=0;
            for(int k=0;k<m;k++)c+=a[j][k];
            if(!c)fl=0;
        }
        for(int j=0;j<m;j++){
            int c=0;
            for(int k=0;k<n;k++)c+=a[k][j];
            if(!c)fl=0;
        }
        if(fl)cnt++;
    }
    cout<<cnt<<"\n";
}
int fac[3000005],ifac[3000005];
int qkp(int b,int p){
    int r=1;
    while(p){
        if(p&1)(r*=b)%=mod;
        p/=2;
        (b*=b)%=mod;
    }
    return r;
}
int C(int n,int m){
    if(n<m)return 0;
    return fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
signed main(){
    cin>>n>>m;
    //if(n<=4&&m<=4){solve();return 0;}
    fac[0]=1;
    for(int i=1;i<=3000000;i++)fac[i]=fac[i-1]*i%mod;
    ifac[3000000]=qkp(fac[3000000],mod-2);
    for(int i=2999999;i>=0;i--){
        ifac[i]=ifac[i+1]*(i+1)%mod;
    }
    int res=0;
    for(int i=0;i<=m;i++){
        int coef=C(m,i)*qkp((qkp(2,m-i)-1+mod)%mod,n)%mod;
        if(i&1)res+=mod-coef;
        else res+=coef;
        res%=mod;
    }
    cout<<res;
    return 0;
}
//https://oeis.org/A183109