#include <iostream>
#include <string>

using namespace std;

int pole[500][8];

int prv[8] = { 2, 3, 5, 7, 11, 13, 17, 19};

int pocitej(int x, int d) {
  int res=0;
  while (x % d == 0) {
    res++;
    x = x/d;
  }
  return res;
}

void init_pole() {
  for (int i=1; i<500; i++)
    for (int j=0; j<8; j++)
      pole[i][j] = pocitej(i,prv[j]);
}



int main() {
  int n, k;
  init_pole();

  while (cin >> n >> k) {
    long long res = 1;
    int pom[8] = {0,0,0,0,0,0,0,0};
    for (int i=n; i>=n-k+1; i--) 
      for (int j=0; j<8; j++)
	pom[j] += pole[i][j];
    for (int i=1; i<=k; i++) 
      for (int j=0; j<8; j++)
	pom[j] -= pole[i][j];
    
    for (int j=0; j<8; j++)
      res *= (pom[j]+1);

    cout <<res<<endl;
  }

  return 0;
}