#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
#define fir first
#define sec second
#define rep(i,a,b) for (int i = (a) ; i <= (b) ; ++ i)
#define rrp(i,a,b) for (int i = (a) ; i >= (b) ; -- i)
#define gc() getchar()
template <typename tp>
inline void read(tp& x) {
  x = 0; char tmp; bool key = 0;
  for (tmp = gc() ; !isdigit(tmp) ; tmp = gc())
    key = (tmp == '-');
  for ( ; isdigit(tmp) ; tmp = gc())
    x = (x << 3) + (x << 1) + (tmp ^ '0');
  if (key) x = -x;
}
template <typename tp>
inline void ckmn(tp& x,tp y) {
  x = x < y ? x : y;
}
template <typename tp>
inline void ckmx(tp& x,tp y) {
  x = x < y ? y : x;
}

const int MOD = (int)(1e9 + 7);
inline void Add(int& x,int y) {
  x = x + y >= MOD ? x + y - MOD : x + y;
}
inline void Sub(int& x,int y) {
  x = x - y < 0 ? x - y + MOD : x - y;
}
int power(int a,int b) {
  int ret = 1;
  while (b) {
    if (b&1) ret = 1ll * ret * a % MOD;
    a = 1ll * a * a % MOD;
    b >>= 1;
  }
  return ret;
}
const int N = 5010;
int dp[N][N], n, m, jc[N], ijc[N];
void prework(int sz) {
  jc[0] = 1;
  rep (i, 1, sz) jc[i] = (ll)jc[i-1] * i % MOD;
  ijc[sz] = power(jc[sz], MOD - 2);
  rrp (i, sz-1, 0) ijc[i] = (ll)ijc[i+1] * (i+1) % MOD;
}
int comb(int a,int b) {
  if (b < 0 || a < b) return 0;
  return (ll)jc[a] * ijc[b] % MOD * ijc[a-b] % MOD;
}
int main() {
  read(n), read(m);
  prework(max(n, m));
  dp[n][1] = 1;
  rrp (i, n, 1) {
    int tmp = 0;
    rep (j, 1, m) {
      Add(dp[i-1][j], (ll)(j+1) * dp[i][j] % MOD);
      Add(dp[i-1][j], tmp);
      Add(tmp, (ll)(2 * j) * dp[i][j] % MOD);
    }
  }
  int ans = 0;
  rep (j, 1, m) {
    Add(ans, (ll)dp[0][j] * comb(m - 1, j - 1) % MOD);
  }
  cout << ans << endl;
  return 0;
}
