【编程题解】Kobe’s bread

Description

Kobe opened a bakery, a counter has N rows of shelves, each row of shelves can store K bread, and each bread has its fresh-keeping deadline days, such as 1, 3, 4,and so on.

Kobe likes to start with the most neatly arranged row, because in this case the bread on the shelf does not need to be processed anymore.

Definition of tidiness: The fewer the reverse order pairs of the dates of the bread in each row of shelves, the more tidy the row of bread. If the freshness date of the bread in the row of shelves is completely ascending, it is the cleanest.

Definition of reverse pair: In an array A, in the case of i <j, if A[i]> A[j], then(i, j) is called a reverse pair in array A.

Would you please help Kobe figure out the order in which to organize the shelves?

 

Input

Enter N in the first line to indicate the number of rack rows.

Enter k in the second line to indicate the amount of bread on each row