#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, k, cur[N];
long long a[N], ans;
priority_queue<pair<long long, int> > q;
template <typename T>
inline void chkmin(T &x, T y) {
  x = min(x, y);
}
template <typename T>
inline void chkmax(T &x, T y) {
  x = max(x, y);
}
template <typename T>
inline void read(T &x) {
  T f = 1;
  x = 0;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -f;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + c - '0';
  x *= f;
}
inline long long calc(int x, int t) {
  long long d = x / t, rest = x % t;
  return d * d * (t - rest) + (d + 1) * (d + 1) * rest;
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    read(a[i]);
    ans += (long long)a[i] * a[i];
    cur[i] = 1;
    q.push(make_pair((long long)a[i] * a[i] - calc(a[i], 2), i));
  }
  for (int i = 1; i <= k - n; ++i) {
    int now = q.top().second;
    ++cur[now];
    ans -= q.top().first;
    q.pop();
    q.push(make_pair(calc(a[now], cur[now]) - calc(a[now], cur[now] + 1), now));
  }
  cout << ans << "\n";
  return 0;
}
