#include <bits/stdc++.h>
int modint(int a, int b) {
  return (((a) >= 0) ? ((a) - (b) * ((a) / (b)))
                     : ((a) - (b) * ((a) / (b) + 1)));
}
long long modll(long long a, long long b) {
  return (((a) >= 0) ? ((a) - (b) * ((a) / (b)))
                     : ((a) - (b) * ((a) / (b) + 1)));
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
long long n, m, k = 1, ans = 1, t = 2;
int i, j, l;
int main() {
  scanf("%I64d%I64d", &n, &m);
  while (m > 0) {
    if (m & 1) k = modll(k * t, ((1e9) + 9));
    t = modll(t * t, ((1e9) + 9));
    m >>= 1;
  }
  for (i = 1; i <= n; i++) ans = modll(ans * (k - i), ((1e9) + 9));
  printf("%I64d\n", ans);
  return 0;
}
