Given: Two $n × m$ matrices $A$ and $B$ with integer entries.
To Do: Make them completely identical. To achieve this goal, perform the following actions in a single move:
1. Choose one of the matrices, either A or B.
2. Choose either one row or one column of the selected matrix.
3. Increment all the numbers in the selected row or column by 1.
What is the minimal number of moves to perform in order to make matrices A and B equal? Or is it just impossible?
Ex: A = [1 1; 1 1] and B = [2 2; 0 0]. So in 2 moves we can make them equal (inc 1st row of A, then inc 2nd row of B)