#include <bits/stdc++.h>
template <class T>
bool chmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool chmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
using namespace std;
const int INF = INT_MAX;
const long long LNF = LONG_LONG_MAX;
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
long long sq(long long i) { return i * i; }
long long cost(int len, int cut) {
  long long seg = len / cut;
  long long rem = len % cut;
  return sq(seg) * (cut - rem) + rem * sq(seg + 1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    long long n, k;
    cin >> n >> k;
    long long a[n], b[n];
    for (long long i = 0; i < n; i++) cin >> a[i];
    long long second = k - n;
    priority_queue<pair<long long, long long>> p;
    long long c = 0;
    for (long long i = 0; i < n; i++) c += a[i] * a[i];
    for (long long i = 0; i < n; i++) b[i] = 1;
    for (long long i = 0; i < n; i++) {
      long long d = cost(a[i], 2) - cost(a[i], 1);
      p.push(make_pair(-d, i));
    }
    for (long long i = 0; i < second; i++) {
      pair<long long, long long> x = p.top();
      p.pop();
      c -= x.first;
      ++b[x.second];
      long long d =
          cost(a[x.second], b[x.second] + 1) - cost(a[x.second], b[x.second]);
      p.push(make_pair(-d, x.second));
    }
    cout << c << '\n';
  }
  return 0;
}
