/*
Jackson Simoneau
SI@UCF 2026 - Intro to Competitive Programming
Contest 2

Solution to Divisors: https://open.kattis.com/problems/divisors
*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
    vector<vector<int>> freq(450, vector<int>(450, 0));
    for(int i = 2; i < 450; i++) {
        int cur = i;
        for(int j = 2; j*j <= i; j++) {
            while(cur % j == 0) {
                cur /= j;
                freq[i][j]++;
            }
        }
        if(cur > 1) freq[i][cur]++;
    }
    
    ll n, k;
    while(cin >> n) {
        cin >> k;
        vector<int> curf(500, 0);
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= i; j++) {
                curf[j] += freq[i][j];
            }
        }

        for(int i = 1; i <= n-k; i++) {
            for(int j = 1; j <= i; j++) {
                curf[j] -= freq[i][j];
            }
        }

        for(int i = 1; i <= k; i++) {
            for(int j = 1; j <= i; j++) {
                curf[j] -= freq[i][j];
            }
        }

        ll res = 1;
        for(int i = 0; i < 500; i++) {
            res *= (curf[i]+1);
        }
        cout << res << endl;
    }
}