#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int n, m;
int ans = 0x7f7f7f7f;
int mins[30], minv[30];
void dfs(int t, int s, int v, int R, int H) {
    if (s + mins[t] > ans)
        return;
    if (v + minv[t] > n)
        return;
    if (t == 0) {
        if (v == n)
            ans = min(ans, s);
        return;
    }
    for (int r = min(R - 1, (int)sqrt(n - v)); r >= t; r--) {
        for (int h = min(H - 1, int((n * 1.0 - v) / r / r)); h >= t; h--) {
            if (v + r * r * h <= n) {
                if (2 * (n - v) / r + s > ans)
                    continue;
                if (t == m)
                    dfs(t - 1, s + 2 * r * h + r * r, v + r * r * h, r, h);
                else
                    dfs(t - 1, s + 2 * r * h, v + r * r * h, r, h);
            }
        }
    }
}
int main() {
    freopen("cake.in", "r", stdin);
    freopen("cake.out", "w", stdout);
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        mins[i] = mins[i - 1] + 2 * i * i;
        minv[i] = minv[i - 1] + i * i * i;
    }
    dfs(m, 0, 0, n, n);
    if (ans == 0x7f7f7f7f)
        cout << 0;
    else
        cout << ans;
    return 0;
}