#include <stdio.h>

int main () {
  int m = 0;
  int n = 0;
  
  int res = 0;
  
  long long ans = 1LL;
  long long mul[5000000] = {};
  
  res = scanf("%d", &m);
  res = scanf("%d", &n);
  
  if (m < n) {
    printf("00000000\n");
    return 0;
  }
  
  if (m-n < n) {
    n = m-n;
  }
  
  for (int i = 0; i < n; i++) {
    mul[i] = (long long) (m-i);
  }
  
  for (int j = n; j > 0; j--) {
    int idx = m%j;
    while (mul[idx]%j != 0 && idx < n) {
      idx += j;
    }
    mul[idx] /= j;
  }
  
  for (int i = 0; i < n; i++) {
    ans = (ans*mul[i])%100000000LL;
  }
  
  printf("%08lld\n", ans);
  return 0;
}