#pragma comment(linker, "/STACK:102400000,102400000")
#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>
using namespace std;
#define CFF freopen ("aaa.txt", "r", stdin)
#define CPPFF ifstream cin ("aaa.txt")
#define DB(ccc) cout << #ccc << " = " << ccc << endl
#define PB push_back
#define MP(A, B) make_pair(A, B)
typedef long long LL;
typedef unsigned long long ULL;
typedef double DB;
typedef pair <int, int> PII;
typedef pair <int, bool> PIB;
const int INF = 0x7FFFFFFF;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int maxn = 1e6 + 6666;
int minval, n, m, cnt[66];
void dfs (int cur, int val, int ri, int hi, int sum)
{
if (cur == 0)
{
if (val == 0) minval = min (minval, sum);
return ;
}
if (sum >= minval || val < cnt[cur-1] || 2 * val / ri + sum >= minval)
return ;
// cout << ri << " " << hi << endl;
for (int i = ri - 1; i >= cur; i--)
{
int pa = min (hi - 1, (val - cnt[cur-1]) / i / i);
for (int j = pa; j >= cur; j--)
{
if (val - i * i * j >= 0)
{
if (cur == m)
dfs (cur - 1, val - i * i * j, i, j, sum + 2 * i * j + i * i);
else
dfs (cur - 1, val - i * i * j, i, j, sum + 2 * i * j);
}
}
}
}
int main()
{
// CFF;
memset (cnt, 0, sizeof (cnt));
for (int i = 1; i <= 22; i++)
cnt[i] = cnt[i-1] + i * i * i;
while (scanf ("%d %d", &n, &m) != EOF)
{
minval = INF;
dfs (m, n, n + 6, n + 6, 0);
if (minval == INF)
puts ("0");
else
printf ("%d\n", minval);
}
return 0;
}