#include <bits/stdc++.h>
using namespace std;
long long int f(long long int l, long long int p) {
  long long int num1 = l / p;
  long long int num2 = l % p;
  return (p - num2) * (num1 * num1) + num2 * (num1 + 1) * (num1 + 1);
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long int n, k;
  cin >> n >> k;
  priority_queue<tuple<long long int, long long int, long long int>> q;
  long long int ans = 0;
  long long int dummy;
  for (long long int i = 0; i < n; i++) {
    cin >> dummy;
    ans += (dummy * dummy);
    q.push(make_tuple(f(dummy, 1) - f(dummy, 2), dummy, 2));
  }
  for (long long int i = 0; i < k - n; i++) {
    auto x = q.top();
    ans -= (get<0>(x));
    dummy = get<1>(x);
    long long int iter = get<2>(x);
    q.pop();
    q.push(make_tuple(f(dummy, iter) - f(dummy, iter + 1), dummy, iter + 1));
  }
  cout << ans << "\n";
}
