#include<bits/stdc++.h>
using namespace std;
 
int n, k, phi[1000005];
 
int main() {
	cin >> n >> k;
	iota(phi, phi + n + 1, 0);
	long long ans = k > 1? 2: 1;
	for (int i = 2; i <= n; i++)
		if (phi[i] == i)
			for (int j = i; j <= n; j += i)
				phi[j] -= phi[j] / i;
	sort(phi + 3, phi + n + 1);
	for (int i = 0; i < k; i++)
		ans += phi[i + 3];
	cout << ans;
}