Planning CodeForces - 854C

Helen works in Metropolis airport. She is responsible for creating a departure schedule. There aren flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.

Metropolis airport is the main transport hub of Metropolia, so it is difficult to keep the schedule intact. This is exactly the case today: because of technical issues, no flights were able to depart during the firstk minutes of the day, so now the new departure schedule must be created.

All n scheduled flights must now depart at different minutes between(k + 1)-th and (k + n)-th, inclusive. However, it's not mandatory for the flights to depart in the same order they were initially scheduled to do so — their order in the new schedule can be different. There is only one restriction: no flight is allowed to depart earlier than it was supposed to depart in the initial schedule.

Helen knows that each minute of delay of the i-th flight costs airportc_i burles. Help her find the order for flights to depart in the new schedule that minimizes the total cost for the airport.

Input

The first line contains two integers n andk (1 ≤ k ≤ n ≤ 300 000), heren is the number of flights, and k is the number of minutes in the beginning of the day that the flights did not depart.

The second line contains n integers c₁, c₂, ..., c_n (1 ≤ c_i ≤ 10⁷), here c_i is the cost of delaying thei-th flight for one minute.

Output

The first line must contain the minimum possible total cost of delaying the flights.

The second line must contain n different integerst₁, t₂, ..., t_n (k + 1 ≤ t_i ≤ k + n), here t_i is the minute when thei-th flight must depart. If there are several optimal schedules, print any of them.

Example

Input

5 2
4 2 1 10 2

Output

20
3 6 7 4 5 

Note

Let us consider sample test. If Helen just moves all flights 2 minutes later preserving the order, the total cost of delaying the flights would be(3 - 1)·4 + (4 - 2)·2 + (5 - 3)·1 + (6 - 4)·10 + (7 - 5)·2 = 38 burles.

However, the better schedule is shown in the sample answer, its cost is (3 - 1)·4 + (6 - 2)·2 + (7 - 3)·1 + (4 - 4)·10 + (5 - 5)·2 = 20 burles.

首先排序，费用高的排在前面，然后在[k,n+k]这个区域中二分查找没有用过的元素，找到之后删除即可。

#include<bits/stdc++.h>
using namespace std;
struct aa
{
    int data,pos;
} s[300010];
int save[300010];
bool cmp(const aa &a,const aa &b)
{
    if(a.data==b.data)
        return a.pos>b.pos;
    return a.data>b.data;
}
int main()
{
    int n,k;
    set<int>ycq;
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        long long sum=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&s[i].data);
            s[i].pos=i;
            ycq.insert(i+k);
        }
        sort(s+1,s+1+n,cmp);
        for(int i=1; i<=n; i++)
        {
            int p=*ycq.lower_bound(s[i].pos);
            ycq.erase(p);
            sum+=(long long)(p-s[i].pos)*(long long)s[i].data;
            save[s[i].pos]=p;
        }
        printf("%lld\n",sum);
        for(int i=1; i<=n; i++)
            printf("%d ",save[i]);
        putchar('\n');
    }
}