#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int mod = 998244353;
long long get(int x, int slice) {
  int sz = x / slice;
  int m = x % slice;
  long long ret =
      (long long)sz * sz * (slice - m) + (long long)(sz + 1) * (sz + 1) * m;
  return ret;
}
void solve() {
  int n, k;
  scanf("%d %d", &n, &k);
  priority_queue<pair<long long, pair<int, int> > > pq;
  int cur = n;
  long long ret = 0;
  for (int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    ret += (long long)x * x;
    if (x != 1) {
      pq.push({get(x, 1) - get(x, 2), {x, 1}});
    }
  }
  while (cur < k) {
    ret -= pq.top().first;
    pair<int, int> t = pq.top().second;
    pq.pop();
    ++cur;
    ++t.second;
    if (t.first >= t.second + 1) {
      pq.push({get(t.first, t.second) - get(t.first, t.second + 1),
               {t.first, t.second}});
    }
  }
  printf("%lld\n", ret);
}
int main() {
  solve();
  return 0;
}
