How do I find the number of distinct n*m binary matrices such that two matrices are identical if and only if one of them can be turned into the other by first suitably permuting the N rows of this matrix and then suitably permuting the M columns of the resulting matrix.
eg:a 1*5 matrix will have 6 distinct binary matrices