#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
  int val;
  int cnt;
  int i;
  inline long long cal(const long long& x, const long long& cnt) const {
    long long num = x / cnt;
    long long res = x % cnt;
    return 1ll * (cnt - res) * num * num + 1ll * res * (num + 1) * (num + 1);
  }
  inline bool operator<(const node& bb) const {
    return cal(val, cnt) - cal(val, cnt + 1) <
           cal(bb.val, bb.cnt) - cal(bb.val, bb.cnt + 1);
  }
};
int a[maxn];
int cnt[maxn];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  priority_queue<node> q;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    cnt[i] = 1;
    q.push({a[i], 1, i});
  }
  int n_ = n;
  while (n_ < k) {
    node tp = q.top();
    q.pop();
    cnt[tp.i]++;
    q.push({tp.val, tp.cnt + 1, tp.i});
    ++n_;
  }
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    long long num = a[i] / cnt[i];
    long long res = a[i] % cnt[i];
    ans += 1ll * (cnt[i] - res) * num * num + 1ll * res * (num + 1) * (num + 1);
  }
  printf("%lld\n", ans);
  return 0;
}
