Matrix Transformation Problem Statement

Given a 2-dimensional matrix of size NxN containing 0s and 1s, the task is to modify the matrix such that, if an element is 1, set its entire row and column to 1. In the end, determine how many 1s are present after completing the operation.

Explanation:

You need to modify the input matrix according to the described transformation. The counting of 1s should be done after all modifications are made.

Input:

The first line contains an integer 'T', representing the number of test cases. For each test case, the first line contains two integers N and M, where N is the number of rows and M is the number of columns of the matrix. The following N lines for each test case contain M integers (either 0 or 1) separated by spaces, representing the matrix.

Output:

For each test case, output the modified matrix with each row printed on a separate line. Each test case output is separated by a new line.

Example:

Input:

2
3 3
0 1 0
0 0 0
0 0 1
4 4
1 0 0 1
0 0 0 0
0 0 0 0
0 0 0 0

Output:

1 1 1
0 1 1
1 1 1

1 1 1 1
1 0 0 1
1 0 0 1
1 0 0 1

Constraints:

• 1 <= T <= 10
• 1 <= N, M <= 200

Note:

You need to make the modifications in the input matrix without using extra space for another matrix. You do not need to print anything in the function; just implement the logic and return the result.