#include <bits/stdc++.h>
using namespace std;
string getString(char x) {
  string s(1, x);
  return s;
}
int highestPowerof2(long long int n) {
  if (n == 0) return 0;
  int p = (int)log2(n);
  return p;
}
long long int calc(int num, int div) {
  int p = num / div;
  int k = num - p * div;
  long long int ans = 0;
  ans += ((long long int)(p + 1) * (p + 1) * k);
  ans += ((long long int)(p)*p * (div - k));
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int test = 1;
  while (test--) {
    int n, k;
    cin >> n >> k;
    priority_queue<pair<long long int, int>> pq;
    vector<int> vec(n);
    vector<int> curr(n, 1);
    for (int i = 0; i < n; i++) {
      cin >> vec[i];
      long long int val = calc(vec[i], curr[i]) - calc(vec[i], curr[i] + 1);
      pq.push(pair<long long int, int>(val, i));
    }
    int req = k - n;
    while (req > 0) {
      req--;
      pair<long long int, int> p = pq.top();
      pq.pop();
      curr[p.second]++;
      int i = p.second;
      long long int val = calc(vec[i], curr[i]) - calc(vec[i], curr[i] + 1);
      p.first = val;
      pq.push(p);
    }
    long long int ans = 0;
    for (int i = 0; i < n; i++) {
      ans += calc(vec[i], curr[i]);
    }
    cout << ans << endl;
  }
  return 0;
}
