#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> arr(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  priority_queue<tuple<long long, int, long long> > pq;
  for (int i = 1; i <= n; i++) {
    long long num1 = arr[i] / 2;
    long long num2 = arr[i] % 2;
    long long var = arr[i] * arr[i] - num2 * (num1 + 1) * (num1 + 1) -
                    (2 - num2) * num1 * num1;
    pq.push(make_tuple(var, 1, i));
  }
  int cnt = n;
  while (cnt < k) {
    auto var = pq.top();
    pq.pop();
    long long a = get<0>(var);
    long long b = get<1>(var);
    long long c = get<2>(var);
    long long num1 = arr[c] / (b + 1);
    long long rem1 = arr[c] % (b + 1);
    long long num2 = arr[c] / (b + 2);
    long long rem2 = arr[c] % (b + 2);
    long long sum1 =
        rem1 * (num1 + 1) * (num1 + 1) + (b + 1 - rem1) * num1 * num1;
    long long sum2 =
        rem2 * (num2 + 1) * (num2 + 1) + (b + 2 - rem2) * num2 * num2;
    pq.push(make_tuple(sum1 - sum2, b + 1, c));
    cnt++;
  }
  long long ans = 0;
  while (!pq.empty()) {
    auto var = pq.top();
    pq.pop();
    long long b = get<1>(var);
    long long c = get<2>(var);
    long long num1 = arr[c] / (b);
    long long rem1 = arr[c] % (b);
    long long sum1 = rem1 * (num1 + 1) * (num1 + 1) + (b - rem1) * num1 * num1;
    ans = ans + sum1;
  }
  cout << ans;
  return 0;
}
