#include <bits/stdc++.h>
using namespace std;
const int DIM = 1e5 + 5;
struct usu {
  long long ch;
  long long bef;
  int k, i;
  bool operator<(const usu &aux) const {
    if (ch != aux.ch) return ch > aux.ch;
    return i < aux.i;
  }
};
int n, k;
int a[DIM];
priority_queue<usu> pq;
void solve() {
  long long sol = 0;
  for (int i = 1; i <= n; ++i) {
    int x = a[i] / 2, y = a[i] / 2 + a[i] % 2;
    sol = sol + 1LL * a[i] * a[i];
    pq.push({1LL * x * x + 1LL * y * y - 1LL * a[i] * a[i],
             1LL * x * x + 1LL * y * y, 2, i});
  }
  int cnt = k - n;
  while (cnt > 0) {
    --cnt;
    long long nv = pq.top().ch, bef = pq.top().bef;
    int k = pq.top().k, i = pq.top().i;
    pq.pop();
    ++k;
    int x = a[i] / k, y = a[i] / k + 1;
    int rest = a[i] % k;
    sol = sol + nv;
    long long aux = 1LL * x * x * (k - rest) + 1LL * y * y * rest;
    pq.push({aux - bef, aux, k, i});
  }
  printf("%lld", sol);
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  solve();
  return 0;
}
