#include <bits/stdc++.h>
using namespace std;
long long rr[] = {0, 1, 1, 1, 0, -1, -1, -1};
long long cc[] = {1, 1, 0, -1, -1, -1, 0, 1};
const long long inf = 1e18;
const long long mod = 1e9 + 7;
const long long N = 300050;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long test = 1;
  while (test--) {
    long long n, k, K;
    cin >> n >> k;
    k -= n;
    K = k;
    long long a[n];
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
    }
    sort(a, a + n, greater<long long>());
    priority_queue<tuple<long long, long long, long long> > q;
    auto find = [&](long long l, long long p) {
      long long tot =
          (l % p) * (l / p + 1) * (l / p + 1) + (p - l % p) * (l / p) * (l / p);
      return tot;
    };
    for (long long i = 0; i < min(k, n); i++) {
      long long diff = find(a[i], 1LL) - find(a[i], 2LL);
      q.push({diff, a[i], 1});
    }
    long long ans = 0;
    for (long long i = min(k, n); i < n; i++) {
      ans += a[i] * a[i];
    }
    while (k--) {
      auto x = q.top();
      q.pop();
      long long D, A, P;
      tie(D, A, P) = x;
      D = find(A, P + 1) - find(A, P + 2);
      q.push({D, A, P + 1});
    }
    while (!q.empty()) {
      long long D, A, P;
      tie(D, A, P) = q.top();
      q.pop();
      ans += find(A, P);
    }
    cout << ans << '\n';
  }
  return 0;
}
