#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
long long binpow(long long x, long long y) {
  long long z = 1;
  while (y > 0) {
    if (y % 2 == 1) z = x * z;
    x = x * x;
    y /= 2;
  }
  return z;
}
pair<int, int> func(int x, int div) {
  if (x % div == 0) return make_pair(x / div, div);
  int val = x / div + 1;
  int val2 = x - (x / div) * div;
  return make_pair(val, val2);
}
long long cost(int a, int b) {
  long long ans = 0;
  pair<int, int> p = func(a, b);
  ans += p.second * binpow(p.first, 2);
  ans += (b - p.second) * binpow(p.first - 1, 2);
  return ans;
}
int main() {
  int n, k;
  cin >> n >> k;
  int arr[n];
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  int cuts[n];
  for (int i = 0; i < n; i++) cuts[i] = 1;
  priority_queue<pair<long long, int>> pq;
  for (int i = 0; i < n; i++)
    pq.push(make_pair(cost(arr[i], cuts[i]) - cost(arr[i], cuts[i] + 1), i));
  for (int i = 0; i < k - n; i++) {
    int id = pq.top().second;
    pq.pop();
    cuts[id]++;
    pq.push(
        make_pair(cost(arr[id], cuts[id]) - cost(arr[id], cuts[id] + 1), id));
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    pair<int, int> p = func(arr[i], cuts[i]);
    ans += p.second * binpow(p.first, 2);
    ans += (cuts[i] - p.second) * binpow(p.first - 1, 2);
  }
  cout << ans << endl;
  return 0;
}
