#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << ", ";
  err(++it, args...);
  cout << "\n";
}
long long powm(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
const long long mod = 1e9 + 7;
const long long N = 1000005;
const long long inf = 1e9;
vector<long long> a;
long long calc(long long len, long long nums) {
  long long unit = len / nums;
  long long extra = len - unit * nums;
  return (nums - extra) * (unit * unit) + extra * (unit + 1) * (unit + 1);
}
void solve() {
  long long n, k;
  cin >> n >> k;
  long long x;
  priority_queue<pair<long long, pair<long long, long long>>> v;
  long long sum = 0;
  for (long long i = 0; i < (n); i++) {
    cin >> x;
    sum += calc(x, 1);
    v.push({calc(x, 1) - calc(x, 2), {x, 2}});
  }
  for (long long i = 0; i < (k - n); i++) {
    auto it = v.top();
    sum -= it.first;
    v.pop();
    v.push({calc(it.second.first, it.second.second) -
                calc(it.second.first, it.second.second + 1),
            {it.second.first, it.second.second + 1}});
  }
  cout << sum << '\n';
}
signed main() {
  cout << fixed << setprecision(15);
  int tc = 1;
  for (int t = 1; t <= tc; t++) {
    solve();
  }
  return 0;
}
