#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

vector<int> prime;
bool isPrime[2100000];

void getPrime() {
    for (int i = 2; i < 2100000; i++) isPrime[i] = true;
    for (int i = 2; i * i < 2100000; i++) {
        if (isPrime[i]) {
            for (int j = 2; j * i < 2100000; j++) {
                isPrime[i*j] = false;
            }
        }
    }
    for (int i = 0; i < 2100000; i++) {
        if (isPrime[i]) prime.push_back(i);
    }
}

int n, k;

int dfs(int now, int limit, int index) {
    if (limit == 0) return n / now;
    int ret = 0;
    for (int i = index; i < prime.size(); i++) {
        if (now * prime[i] > n) break;
        ret += dfs(now*prime[i], limit-1, i+1);
    }
    return ret;
}

int main(void) {
    getPrime();
    cin >> n >> k;
    int ans = 0;
    for (int i = 0; i < prime.size() && prime[i] <= n; i++) {
        ans += dfs(prime[i], k-1, i+1);
    }
    cout << ans << endl;
    return 0;
}