#include <cstdio>

typedef long long LL;

const int N=500005;

int n,M,t;

LL f[N],g[N],a[N],s[N],INF=1LL<<60;

void DP(int l,int r,int dl,int dr){

    int m=(l+r)>>1,i,dm=0;

    LL &ret=g[m]; ret=INF;

    for(i=dl;i<=dr&&i<m;i++){

        LL t=f[i]+(s[m]-s[i])*(s[m]-s[i])+M;

        if(t<ret)ret=t,dm=i;

    }if(l<m)DP(l,m-1,dl,dm);

    if(r>m)DP(m+1,r,dm,dr);

}

void CDQ(int l,int r){

    if(l==r)return;

    int mid=(l+r)>>1;

    CDQ(l,mid);

    DP(mid+1,r,l,mid);

    for(int i=r;i>mid;i--)if(g[i]<f[i])f[i]=g[i];

    CDQ(mid+1,r);

}

int main(){

    while(~scanf("%d%d",&n,&M)){

        for(int i=1;i<=n;i++){scanf("%lld",&s[i]);s[i]+=s[i-1];}

        for(int i=1;i<=n;i++)f[i]=s[i]*s[i]+M;CDQ(0,n);

        printf("%lld\n",f[n]);

    }return 0;

}