LL f(int a,int b){
	return 1LL*(a/b)*(a/b)*(b-a%b)+1LL*(a/b+1)*(a/b+1)*(a%b);
}
struct node{
	int a,k;
	LL d;
	node(int a=0,int k=0){
		this->a=a;
		this->k=k;
		d=f(a,k)-f(a,k+1);
	}
	bool operator < (const node &b)const{
		return d<b.d;
	}
};
priority_queue<node> q;
int main()
{
	int n=read_int(),k=read_int();
	LL ans=0;
	_for(i,0,n){
		int a=read_int();
		q.push(node(a,1));
		ans+=1LL*a*a;
	}
	while(n<k){
		node temp=q.top();q.pop();
		ans-=temp.d;
		q.push(node(temp.a,temp.k+1));
		n++;
	}
	enter(ans);
	return 0;
}