#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "URDL";
const long long MOD2 = (long long)998244353 * (long long)998244353;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 998244353) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
void fmain(int tid) {
  scanf("%d%d", &n, &k);
  if (k == 1)
    puts("3");
  else if (k == 2)
    puts("6");
  else {
    vector<int> phi(n + 5, 0);
    for (int i = 1; i <= n; i++) {
      phi[i] += i;
      for (int j = 2 * i; j <= n; j += i) phi[j] -= phi[i];
    }
    long long ans = 6;
    vector<int> vp;
    for (int i = 5; i <= n; i++) vp.push_back(phi[i]);
    sort(vp.begin(), vp.end());
    for (int(j) = 0; (j) < (int)(k - 2); (j)++) ans += vp[j];
    printf("%lld\n", ans);
  }
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
