Source

This problem is adapted from Long Long OJ. All rights reserved.

Problem Description

Zero likes to print articles using an old-fashioned printer.

One day, he wants to print an article with $N$ characters, where the size of the $i$-th character is $C_i$.

The cost of printing the article is calculated as follows:

• Printing each line incurs a paper cost of $M$ units, where $M$ is a constant.
• The ink cost for each line is the square of the sum of the sizes of all characters in that line.

Now, Zero wants to find the minimum cost required to print the article.

Input Format

This problem contains multiple test cases.

For each test case:

• The first line contains two positive integers $N, M$.
• The next $N$ lines each contain a positive integer $C_i$.

The input ends with EOF.

Output Format

For each test case, output a single line with a positive integer representing the minimum cost of printing the article.

Samples

5 5
5
9
5
7
5
4 3
1
1
1
1

230
14

Data Range

For $100\%$ of the test cases, $1 \le N \le 10^5$, $1 \le M \le 1000$, $1 \le C_i \le 1000$.

It is guaranteed that the total number of input numbers does not exceed $10^5$.