#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#define N 1005
#define ri register int
#define fo(i,l,r) for(ri i=l;i<=r;i++)
#define rf(i,r,l) for(ri i=r;i>=l;i--)
#define ll long long
using namespace std;
int n,m,sum[N],su[N],sm[N][N],r[N],h[N],ans=2147483647;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int abs(int x){return x<0?-x:x;}
void dfs(int i,int v,int s,int n)
{
	if(!n){if(!v&&s<ans)ans=s;return;}
	if(v<0)return;
	if(sum[n]>v)return;
	if(sm[r[i-1]-1][h[i-1]-1]-sm[r[i-1]-n-1][h[i-1]-n-1]<0)return;
	if(s+su[n]>=ans)return;
	rf(j,r[i-1]-1,n)
		rf(k,h[i-1]-1,n)
		{
			r[i]=j;h[i]=k;
			dfs(i+1,v-j*j*k,s+(i==1)*j*j+2*j*k,n-1);
		}
}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
} 
int main(){
    freopen("cake.in","r",stdin);freopen("cake.out","w",stdout);
    n=read();m=read();
    if(!n||!m)return !printf("0");
    fo(i,1,m)sum[i]=sum[i-1]+i*i*i,su[i]=su[i-1]+2*i*i;
    fo(i,1,r[0])fo(j,1,r[0])sm[i][j]=sm[i-1][j-1]+i*i*j;
    r[0]=h[0]=sqrt(n);
    if(r[0]<=m||h[0]<=m)return !printf("0");
    dfs(1,n,0,m);
    printf("%d",ans^2147483647?ans:0);
    return 0;
}