Description

The North Pole Beach Bank has to decide upon a set App of mortgage applications. Each application a∈App has an acceptance deadline d_a, ie. the required loan must be paid at a time t_a, 0≤t_a≤d_a. If the application is accepted the Bank gets a profit p_a. Time is measured in integral units starting from the conventional time origin 0, when the Bank decides upon all the App applications. Moreover, the Bank can pay a maximum number of L loans at any given time. The Bank policy if focussed solely on profit: it accepts a subset S⊆App of applications that maximizes the profit . The problem is to compute the maximum profit the Bank can get from the given set App of mortgage applications.

For example, consider that L=1, App={a,b,c,d}, (p_a,d_a)=(4,2), (p_b,d_b)=(1,0), (p_c,d_c)=(2,0), and (p_d,d_d)=(3,1). The table below shows all possible sets of accepted mortgage applications and the scheduling of the loan payments. The highest profit is 9 and corresponds to the set {c,d,a}. The loan requested by the application c is paid at time 0, the loan corresponding to d is paid at time 1, and, finally, the loan of a is paid at time 2.

Input

Write a program that reads sets of data from an input text file. Each data set corresponds to a set of mortgage applications and starts with two integers: 0≤N≤10000 that shows the number of applications in the set, and 0≤L≤100 which shows the maximum number of loans the Bank can pay at any given time. Follow N pairs of integers p_i d_i, i=1..N, that specify the profit 0≤p_i≤10000 and the deadline 0≤d_i≤10000 of the application i. Input data are separated by white spaces, are correct, and terminate with an end of file.

Output

For each data set the program computes the maximum profit the Bank can get from the accepted mortgage applications corresponding to that data set. The result is printed on standard output from the beginning of a line. There must be no empty lines on output. An example of input/output is shown below.

4 1     4 2  1 0   2 0    3 1
7 2
200 1   200 1   100 0   1000 2    80 1
50 20   500 1
0 100
1 0     4 1000

9
2050
0
0

Source