#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
  return b == 0 ? a : gcd(b, a % b);
}
inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b % 2) res *= a;
    a *= a;
    b /= 2;
  }
  return res;
}
const int m4i[4] = {-1, 0, 1, 0}, m4j[4] = {0, 1, 0, -1};
const int m8i[8] = {-1, -1, 0, 1, 1, 1, 0, -1},
          m8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int mxn = 1e5 + 5;
int n, k;
long long cost, x;
priority_queue<pair<long long, pair<long long, long long> > > pq;
long long sq(long long chad) { return chad * chad; }
long long val(long long len, long long nums) {
  long long unit = len / nums;
  long long extra = len - unit * nums;
  return (nums - extra) * sq(unit) + extra * sq(unit + 1);
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> x;
    cost += sq(x);
    pq.push(pair<long long, pair<long long, long long> >(
        val(x, 1) - val(x, 2), pair<long long, long long>(x, 2)));
  }
  for (int i = 0; i < k - n; i++) {
    cost -= pq.top().first;
    int a = pq.top().second.first, b = pq.top().second.second;
    pq.pop();
    pq.push(pair<long long, pair<long long, long long> >(
        val(a, b) - val(a, b + 1), pair<long long, long long>(a, b + 1)));
  }
  cout << cost << endl;
}
