#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
struct node {
  long long val;
  int num, id;
  bool operator<(const node &a) const { return a.val > val; }
};
long long solve(long long x, int num) {
  long long ret = x / num, res = x % num;
  long long ans =
      1ll * res * (ret + 1) * (ret + 1) + 1ll * (num - res) * ret * ret;
  return ans;
}
priority_queue<node> q;
int a[N];
int n, k;
long long sum = 0;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = 1; i <= n; ++i) {
    sum += (1ll * a[i] * a[i]);
    if (a[i] == 1) continue;
    node nw;
    nw.val = 1ll * a[i] * a[i] - solve(a[i], 2);
    nw.num = 2;
    nw.id = i;
    q.push(nw);
  }
  if (n == k) {
    printf("%lld\n", sum);
    return 0;
  }
  int cnt = 0;
  while (!q.empty()) {
    ++cnt;
    node st = q.top();
    q.pop();
    sum -= st.val;
    if (cnt == (k - n)) {
      printf("%lld\n", sum);
      return 0;
    }
    if (a[st.id] < (st.num + 1)) continue;
    node nw;
    nw.val = solve(1ll * a[st.id], st.num) - solve(1ll * a[st.id], st.num + 1);
    nw.num = st.num + 1;
    nw.id = st.id;
    q.push(nw);
  }
  return 0;
}
