#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> a;
struct info {
  int id, split;
  info(int _id, int _split) {
    id = _id;
    split = _split;
  }
  long long sqr(int a) { return 1LL * a * a; }
  long long cost() {
    int x = a[id] / split;
    int y = a[id] % split;
    return (split - y) * sqr(x) + y * sqr(x + 1);
  }
  bool operator<(const info &A) const {
    long long p1 = info(id, split).cost() - info(id, split + 1).cost();
    long long p2 = info(A.id, A.split).cost() - info(A.id, A.split + 1).cost();
    return p1 < p2;
  }
};
int main() {
  ios ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  if (fopen("main.in", "r")) freopen("main.in", "r", stdin);
  cin >> n >> k;
  a.resize(n + 1);
  for (int i = 1; i <= n; i++) cin >> a[i];
  long long res = 0;
  priority_queue<info> heap;
  for (int i = 1; i <= n; i++) {
    heap.push({i, 1});
    res += info(i, 1).cost();
  }
  for (int i = n + 1; i <= k; i++) {
    info it = heap.top();
    heap.pop();
    info nxt = {it.id, it.split + 1};
    res -= it.cost() - nxt.cost();
    heap.push(nxt);
  }
  cout << res << '\n';
  return 0;
}
