#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>
#define lson rt << 1, l, m
#define rson rt << 1 | 1, m + 1, r
using namespace std;
const int INF = 0x7FFFFFFF;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int MOD = 7;
const int maxn = 666 + 66;
bool prime[maxn];
int primelist[maxn], num;
int f[maxn][maxn];
void GetPrime ()
{
memset (prime, true, sizeof (prime));
num = 0;
int i;
for (i = 2; i <= maxn; i++)
{
if (prime[i])
primelist[num++] = i;
int j;
for (j = 0; j < num; j++)
{
if (i * primelist[j] > maxn)
break;
prime[i*primelist[j]] = false;
if (i % primelist[j] == 0)
break;
}
}
}
int Solve (int val, int fa)
{
int sum = 0, temp = fa;
while (val / fa)
{
sum += val / fa;
fa *= temp;
}
return sum;
}
int main()
{
// ifstream cin ("aaa.txt");
// freopen ("aaa.txt", "r", stdin);
GetPrime ();
for (int i = 1; i <= 440; i++)
{
for (int j = 0; j < num; j++)
f[i][j] = Solve (i, primelist[j]);
}
long long n, k;
while (scanf ("%d%d", &n, &k) != EOF)
{
long long ans = 1;
for (int i = 0; i < num && primelist[i] <= n; i++)
ans *= (f[n][i] - f[n-k][i] - f[k][i] + 1);
printf ("%lld\n", ans);
}
return 0;
}