It is desired to create a priority queue with max$-$heap$-$tree property in each row of an NxM matrix. On the other hand, the capacity of each queue is different. The number of columns of the matrix should be determined according to the highest capacity of the priority queues. In each step, the highest priority of the first elements of the priority queues is removed from the relevant queue. These steps continue until there are no elements left in the queues. The algorithm you will design should print the idle queues on the screen in order.

$1.$ Read the matrix dimensions $($N and M$)$ from outside.

$2.$ The N$-$dimensional array storing the capacity of each priority queue must be read from outside.

$3.$ The numbers you generate between $0-$K $($K$>$NxM$)$ are randomly assigned to the matrix according to the size of the queues.

must be placed. There should be $1$ of each number in the matrix. In other words, the matrix should consist of "unique" numbers.

$4.$ After random number placement in the matrix, the matrix should be printed on the screen. Then each

The priority queue should be edited to have the max$-$heap$-$tree property and the new version of the matrix should be printed on the screen.

$5.$ After all the queues are organized, it is expected to obtain the maximum elements from the queues and remove the highest one from the relevant queue.

$6.$ After the element is removed, the relevant queue should be reorganized to have the max$-$heap$-$tree property.

should be edited.

$7.$ The new state of the matrix at the end of that step should be printed on the screen.

$8.$ The number of the priority queue that is out of elements must be replaced by another array.

$9.$ When all queues are empty, a series of screens with queue information should be printed.