#include <bits/stdc++.h>
using namespace std;
constexpr static int MAXN = 1e5 + 10;
int n, k;
int a[MAXN];
int num[MAXN];
int64_t calc(int64_t val, int m) {
  int64_t base = val / m;
  int64_t rem = val % m;
  if (rem == 0) return base * base * m;
  return base * base * (m - rem) + (base + 1) * (base + 1) * rem;
}
int64_t calc_diff(int64_t val, int m) {
  return calc(val, m) - calc(val, m + 1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  priority_queue<pair<int64_t, int>> pq;
  for (int i = 0; i < n; i++) {
    num[i] = 1;
    if (a[i] == 1) continue;
    pq.push({calc_diff(a[i], 1), i});
  }
  for (int l = 0; l < k - n; l++) {
    auto t = pq.top();
    pq.pop();
    int i = t.second;
    num[i]++;
    if (num[i] < a[i]) pq.push({calc_diff(a[i], num[i]), i});
  }
  int64_t total = 0;
  for (int i = 0; i < n; i++) total += calc(a[i], num[i]);
  cout << total << endl;
}
