Problem Summary

You are given an $n \times m$ matrix containing integers. By repeatedly swapping adjacent elements in rows and columns, you want to transform the matrix into a state where the values are arranged in nondecreasing order when read row by row.

Your task is to determine the minimum total number of adjacent swaps needed to achieve this arrangement. If the matrix can already be considered sorted in this reading order, the answer is $0$.

Interpretation

Think of the matrix entries as a flattened sequence in row-major order. The goal is to measure how much local movement is needed to place the elements into sorted order.

Input Format

• The first line contains two integers $n$ and $m$.
• The next $n$ lines each contain $m$ integers describing the matrix.

Output Format

• Print a single integer: the minimum total number of adjacent swaps needed.

Constraints

• $1 \le n, m$
• The matrix contains integers that can be compared and sorted.
• The answer fits in a 64-bit signed integer.

Hints

• Flatten the matrix into a one-dimensional array in row-major order.
• The required number of adjacent swaps is closely related to how far each element must move from its current position to its sorted position.
• Stable handling of equal values can matter when counting movements.