


Query 1: 1 R index
Query 2: 1 C index
Query 3: 2 R index
Query 4: 2 C index
In each query, the first input is the type of the query, the second input is whether we have to consider the row ('R') or the column ('C') and the third input is the index of the row/column.
For each type 1 query, we need to flip the elements of the row/column having the given index.
For each type 2 query, we have to output the number of zeros present in the row/column having the given index.
Note that the matrix is a binary matrix, meaning that it only contains either 0 or 1.
Given M = 3, N = 3,
Queries : 1R1, 1R2, 2C1
So, in the above example the change in the matrix would look like this:

Next query 2C1 will return the count of the number of zeroes in the 1st column: 1
The first line contains an integer ‘T’ which denotes the number of test cases.
The first line of each test case contains two space-separated integers ‘M’ and ‘N’, denoting the dimensions of the matrix.
The next line contains a single integer ‘Q’ denoting the number of queries.
The next ‘Q’ lines of each test contain the queries.
For each test case, return a single integer denoting the number of zeroes according to the given query of type 2.
Print the output of each test case in a separate line.
You don’t need to print anything; It has already been taken care of. Juts implement the given function.
1 <= T <= 10
1 <= M, N <= 100
1 <= Q <= 1000
1 <= R <= M
1 <= C <= N
type = 1, 2
Time limit: 1 sec
A simple idea is to traverse the given row or column. If you come across a query that is of type 1 then swap 0 with 1 and vice-versa and for the query of type 2 initialize a variable ‘COUNT’ and increment count when you encounter ‘0’ and return ‘COUNT’.
The steps are as follows: