#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define RREP(i,n) for(int i=(n)-1;i>=0;--i)
#define GOODBYE do { cout << "0" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug false
#define debug2 false

long long power(long long b,long long e){
  long long r=1;
  while(e){
      if(e&1){
          r=(r*b)%MOD;
      }
      b=(b*b)%MOD;
      e >>=1;
  }
  return r;
}


int main(void){
    ll N,M;
    cin >> N >> M;
    vector<ll> dp,dp2;
    vector<ll> pow2;
    pow2.push_back(1);
    REP(i,M){
        pow2.push_back((pow2[pow2.size()-1]*2)%MOD);
    }
    
    dp=pow2;
    dp2.resize(M+1,0);
    ll inv2 = power(2,MOD-2);
    
    
    //dp2[n][m]:=dp[n][m]*m*2^{-m}
    
    for(ll n=2;n<=N;n++){
        vector<ll> temp(M+1,0);
        
        //dp2[n][m]=dp[n][m]*m*2^{-m}
        ll invpow = inv2;
        for(ll m=1;m<=M;m++){
            dp2[m] = (((dp[m]*m)%MOD)*invpow)%MOD;
            invpow = (invpow*inv2)%MOD;
        }
        
        //tempはdp2の累積和
        for(ll m=1;m<=M;m++){
            if(m==1){
                temp[m]=dp2[m];
                temp[m]%=MOD;
            }else{
                temp[m]=temp[m-1]+dp2[m];
                temp[m]%=MOD;
            }
        }
        
        //そのtempに2^mをかける
        int pospow = 2;
        for(ll m=1;m<=M;m++){
            temp[m] = (temp[m]*pospow)%MOD;
            pospow = (pospow*2)%MOD;
        }
        
        //dpにm+1をかける
        for(ll m=1;m<=M;m++){
            dp[m] = (dp[m]*(m+1))%MOD;
        }
        
        //dp[m]とtemp[m-1]を足して完了
        for(ll m=2;m<=M;m++){
            dp[m] += temp[m-1];
            dp[m]%=MOD;
        }
        
        /*
        for(ll m=1;m<=M;m++){
            cout << dp[m] << " ";
        }cout << endl;
        */
    }
    
    cout << dp[M] << endl;
    
    
    return 0;
}







/*
//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

  using i8 = std::int_fast8_t;
  using i32 = std::int_fast32_t;
  using i64 = std::int_fast64_t;
  using u8 = std::uint_fast8_t;
  using u32 = std::uint_fast32_t;
  using u64 = std::uint_fast64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class F> class rec_lambda {
    F f;

  public:
    rec_lambda(F&& f) : f(std::move(f)) {}
    template <class... Args> auto operator()(Args&&... args) const {
      return f(*this, std::forward<Args>(args)...);
    }
  };
  template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }
  constexpr char eoln = '\n';
  template <class T> T ceildiv(const T& l, const T& r) {
    return l / r + (l % r != 0 ? 1 : 0);
  }

} // namespace n91
#include <cstdint>

template <std::uint_fast64_t mod> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 v;

  constexpr modint(const u64 x = 0) noexcept : v(x% mod) {}
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint& operator+=(const modint rhs) noexcept {
    v += rhs.v;
    if (v >= mod)
      v -= mod;
    return *this;
  }
  constexpr modint& operator-=(const modint rhs) noexcept {
    if (v < rhs.v)
      v += mod;
    v -= rhs.v;
    return *this;
  }
  constexpr modint& operator*=(const modint rhs) noexcept {
    v = v * rhs.v % mod;
    return *this;
  }
  constexpr modint& operator/=(modint rhs) noexcept {
    u64 exp = mod - 2;
    while (exp != 0) {
      if (exp % 2 != 0)
        *this *= rhs;
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};
namespace n91 {

  void main_() {
    using mint = modint<1000000007>;
    const usize n = scan<usize>();
    const usize m = scan<usize>();
    std::vector<mint> pow2(n + 1, 1);
    for (const usize i : rep(0, n)) {
      pow2[i + 1] = pow2[i] * 2;
    }
    std::vector<mint> dp(m + 1, 1);
    for (const usize loop : rep(0, n)) {
      std::vector<mint> nx(m + 1, 0);
      mint acc = 0;
      for (const usize i : rep(1, m + 1)) {
        nx[i] = acc + dp[i] * (i + 1);
        acc *= 2;
        acc += dp[i] * i;
      }
      dp = std::move(nx);
    }
    std::cout << dp[m].v << eoln;
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}
*/



Measured memory_bytes: 3756