#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,fast-math,inline,no-stack-protector")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,avx2,abm,mmx,popcnt")
using namespace std;
long long cut(long long x, long long n) {
  long long lowest = x / n;
  long long highest = lowest + 1;
  long long cnthighest = x % n;
  long long cntlowest = n - cnthighest;
  return lowest * lowest * cntlowest + highest * highest * cnthighest;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n == k) {
    long long ans = 0;
    for (long long &el : a) {
      ans += el * el;
      ;
    }
    cout << ans << endl;
    return 0;
  }
  sort(a.begin(), a.end());
  vector<long long> cnt(n, 1);
  set<pair<long long, long long>> ss;
  for (long long i = 0; i < n; i++) {
    if (a[i] != 1) {
      ss.insert({cut(a[i], 2) - cut(a[i], 1), i});
    }
  }
  long long need = k - n;
  while (need) {
    need--;
    auto pp = *ss.begin();
    ss.erase(ss.begin());
    cnt[pp.second]++;
    if (cnt[pp.second] != a[pp.second]) {
      ss.insert({cut(a[pp.second], cnt[pp.second] + 1) -
                     cut(a[pp.second], cnt[pp.second]),
                 pp.second});
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    ans += cut(a[i], cnt[i]);
  }
  cout << ans << endl;
}
