#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define db double

using namespace std;

typedef long long ll;

int const xn=5e5+;

int n,m,q[xn];

ll f[xn],s[xn];

int rd()

{

  int ret=,f=; char ch=getchar();

  while(ch<''||ch>''){if(ch=='-')f=; ch=getchar();}

  while(ch>=''&&ch<='')ret=(ret<<)+(ret<<)+ch-'',ch=getchar();

  return f?ret:-ret;

}

ll y(int i){return (ll)s[i]*s[i]+f[i];}

ll up(int i,int j){return y(i)-y(j);}

ll dn(int i,int j){return s[i]-s[j];}

db slp(int a,int b){return 1.0*(y(a)-y(b))/(s[a]-s[b]);}

int main()

{

  while(~scanf("%d%d",&n,&m))

    {

      memset(f,,sizeof f);

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

      int h=,t=;

      for(int i=;i<=n;i++)

    {

      //while(h<t&&slp(q[h+1],q[h])<=2*s[i])h++;//<=

      while(h<t&&up(q[h+],q[h])<=*s[i]*dn(q[h+],q[h]))h++;//顺序

      f[i]=f[q[h]]+(ll)(s[i]-s[q[h]])*(s[i]-s[q[h]])+m;

      //while(h<t&&slp(q[t],q[t-1])>=slp(i,q[t-1]))t--;//>=

      while(h<t&&up(q[t],q[t-])*dn(i,q[t-])>=up(i,q[t-])*dn(q[t],q[t-]))t--;

      q[++t]=i;

    }

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

    }

  return ;

}