B. Devu, the Dumb Guy

B. Devu, the Dumb Guy

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Devu is a dumb guy, his learning curve is very slow. You are supposed to teach him n subjects, the ith subject has ci chapters. When you teach him, you are supposed to teach all the chapters of a subject continuously.

Let us say that his initial per chapter learning power of a subject is x hours. In other words he can learn a chapter of a particular subject in x hours.

Well Devu is not complete dumb, there is a good thing about him too. If you teach him a subject, then time required to teach any chapter of the next subject will require exactly 1 hour less than previously required (see the examples to understand it more clearly). Note that his per chapter learning power can not be less than 1 hour.

You can teach him the n subjects in any possible order. Find out minimum amount of time (in hours) Devu will take to understand all the subjects and you will be free to do some enjoying task rather than teaching a dumb guy.

Please be careful that answer might not fit in 32 bit data type.

Input

The first line will contain two space separated integers n, x (1 ≤ n, x ≤ 105). The next line will contain n space separated integers:c1, c2, ..., cn (1 ≤ ci ≤ 105).

Output

Output a single integer representing the answer to the problem.

Sample test(s)

input

2 34 1

output

11

input

4 25 1 2 1

output

10

input

3 31 1 1

output

6

Note

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;


#define maxn 100005


int main()
{
    long long int num[maxn] = {0};
    long long sum = 0;
    long long n,x;
    scanf("%lld %lld",&n, &x);
    for( int i = 0; i<n; i++)
    {
        scanf("%lld",&num[i]);
    }
    sort(num,num+n);
    for(int i = 0; i<n; i++)
    {
        sum += num[i]*x;
        if(x!= 1)
         x--;
    }
    printf("%lld\n",sum);
    return 0;
}