#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5 + 10;
int d[N], a[N];
priority_queue<pair<long long, int> > q;
long long x2(long long x) { return x * x; }
long long cal(long long x, long long k) {
  long long val = x / k;
  long long num1 = x % k;
  long long num0 = k - num1;
  return num0 * x2(val) + num1 * x2(val + 1);
}
long long solve() {
  pair<long long, int> x = q.top();
  q.pop();
  int id = x.second;
  if (x.first == 1) return 0;
  long long tmp = x.first;
  q.push({cal(a[id], d[id]) - cal(a[id], ++d[id]), id});
  return x.first;
}
int main() {
  int n, k;
  cin >> n >> k;
  long long ans = 0;
  for (int i = 1; i <= n; i++) cin >> a[i], ans += 1ll * a[i] * a[i], d[i] = 2;
  for (int i = 1; i <= n; i++) {
    q.push({1ll * x2(a[i]) - x2(a[i] / 2) - x2(a[i] - a[i] / 2), i});
  }
  k -= n;
  while (k--) {
    ans -= solve();
  }
  cout << ans;
}
