#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N, K;
bool np[2000001];
vector<int> ps;
set<int> rs;

void solve(int k, int pi, ll v) {
	if (v > N) return;
	if (k <= 0) {
		for (ll i = v; i <= N; i += v) rs.insert(i);
	}
	else {
		FOR(i, pi, ps.size()) solve(k - 1, i + 1, v * ps[i]);
	}
}

int main(int argc, char **argv) {
	cin >> N >> K;
	CLEAR(np);
	np[0] = np[1] = true;
	FOR(i, 2, N + 1) {
		if (np[i]) continue;
		for (int j = i * 2; j <= N; j += i) np[j] = true;
	}
	REP(i, N + 1) if (!np[i]) ps.push_back(i);
	solve(K, 0, 1);
	cout << rs.size() << endl;
	return 0;
}