Defragmentation of permutation tables with four columns

We consider a table with columns each of which contains each symbol of an alphabet $A$ precisely once; the remaining elements of a column are equal to zero. It is required to transform the table preserving the sets of elements in each row and each column to the form with consecutively placed elements of alphabet $A$ in each row. We give conditions for solvability of this problem.