#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <functional>
#include <map>
using namespace std;

long long N, K, dp[44][100009];

int main() {
	cin >> N >> K;
	if (K >= 40) { cout << "0" << endl; return 0; }

	for (int i = 1; i <= N; i++) dp[1][i] = 1;
	for (int i = 2; i <= 40; i++) {
		for (int j = 1; j <= N; j++) {
			for (int k = 2 * j; k <= N; k += j) {
				dp[i][k] += dp[i - 1][j];
			}
		}
	}
	long long sum = 0;
	for (int i = 1; i <= N; i++) sum += dp[K][i];
	cout << sum << endl;
	return 0;
}
