#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
int n, k;
ll a[maxn];
ll cal(ll x, ll num) {
  ll a1 = x / num, n2 = x % num;
  ll n1 = num - n2, a2 = a1 + 1;
  return a1 * a1 * n1 + a2 * a2 * n2;
}
priority_queue<pair<ll, pair<ll, ll>>> q;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> k;
  ll sum = 0;
  for (int i = (1); i <= (int)(n); i++) {
    cin >> a[i];
    sum += a[i] * a[i];
  }
  for (int i = (1); i <= (int)(n); i++)
    q.push({cal(a[i], 1) - cal(a[i], 2), {a[i], 1}});
  int m = k - n;
  while (m--) {
    auto now = q.top();
    q.pop();
    sum -= now.first;
    ll sum = now.second.first, cnt = now.second.second;
    q.push({cal(sum, cnt + 1) - cal(sum, cnt + 2), {sum, cnt + 1}});
  }
  cout << sum << '\n';
  return 0;
}
