#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
long long int power(long long int x, long long int y) {
  long long int ans = 1;
  x %= 1000000007;
  while (y) {
    if (y & 1) ans = (x * ans) % 1000000007;
    x = (x * x) % 1000000007;
    y >>= 1;
  }
  return ans;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
long long int cost(pair<long long int, long long int> p1) {
  long long int len = p1.first;
  long long int parts = p1.second;
  long long int base = len / parts;
  long long int rem = len % parts;
  long long int ans = 0;
  ans += (rem * (base + 1) * (base + 1));
  ans += ((parts - rem) * (base)*base);
  return ans;
}
long long int diff(pair<long long int, long long int> p1) {
  long long int c1 = cost(p1);
  p1.second++;
  long long int c2 = cost(p1);
  return c1 - c2;
}
class Compare {
 public:
  bool operator()(pair<long long int, long long int> p1,
                  pair<long long int, long long int> p2) {
    return diff(p1) < diff(p2);
  }
};
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  priority_queue<pair<long long int, long long int>,
                 vector<pair<long long int, long long int> >, Compare>
      pq;
  for (int i = 0; i < n; i++) {
    pq.push({arr[i], 1});
  }
  k -= n;
  while (k--) {
    pair<long long int, long long int> curr = pq.top();
    pq.pop();
    curr.second++;
    pq.push(curr);
  }
  long long int ans = 0;
  while (!pq.empty()) {
    ans += cost(pq.top());
    pq.pop();
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}
