#include<bits/stdc++.h>
using namespace std;
long long n,p,a[500005],b[500005];
long long l[500005],f[500005];
int main(){
    freopen("2019partition.in","r",stdin);
    freopen("2019partition.out","w",stdout);
    cin>>n>>p;
    if(p){ cout<<0; return 0;}
    for(int i=1;i<=n;i++){
        cin>>a[i];
        b[i]=b[i-1]+a[i];
    }
    f[1]=a[1]*a[1],l[1]=a[1];
    for(int i=2;i<=n;i++){
        for(int j=0;j<i;j++){
            if(b[i]-b[j]>=l[j]){
                f[i]=f[j]+(b[i]-b[j])*(b[i]-b[j]);
                l[i]=b[i]-b[j];
            }
        }
    }
    cout<<f[n];
	return 0;
}