#include <bits/stdc++.h>
using namespace std;
void PrintArrInt(int arr[], int s, int e) {
  for (int i = s; i <= e; i++) {
    if (i == s)
      printf("%d", arr[i]);
    else
      printf(" %d", arr[i]);
  }
  putchar('\n');
}
const int maxn = 100000 + 5;
int N, K, arr[maxn];
struct Node {
  long long d;
  int val, div;
  bool operator<(const Node& rhs) const { return d < rhs.d; }
};
priority_queue<Node> q;
long long calc(int a, int div) {
  long long t = a / div, tm = a % div;
  return tm * (t + 1) * (t + 1) + (div - tm) * t * t;
}
int main() {
  scanf("%d%d", &(N), &(K));
  for (int i = (1); i <= (N); i++) scanf("%d", &(arr[i]));
  long long sum = 0;
  for (int i = (1); i <= (N); i++) {
    long long d = 1ll * arr[i] * arr[i];
    sum += d;
    d -= calc(arr[i], 2);
    q.push(Node{d, arr[i], 2});
  }
  K -= N;
  while (K--) {
    Node n = q.top();
    q.pop();
    sum -= n.d;
    q.push(Node{calc(n.val, n.div) - calc(n.val, n.div + 1), n.val, n.div + 1});
  }
  printf("%lld\n", (sum));
  return 0;
}
