For this Question: An element of the matrix is called strange if its corresponding row and column contains all 1's. Given a boolean matrix of size N*M, your task is to find the number of strange elements.The first line of input contains two space-separated integers N and M. Next N lines of input contain M space-separated integers depicting the values of the matrix.

<b>Constraints:-</b>
3 &le;  N, M &le; 50
0 &le;  Matrix[][] &le; 1Print the number of strange elementsSample Input:-
3 2
1 1
0 1
1 1

Sample Output:-
2

Sample Input:-
4 4
1 0 1 1
0 1 1 1
1 1 1 1 
0 1 1 1

Sample Output:-
2

<b>Explanation 1:-</b>
(0, 1) and (2, 1), I have written this Solution Code: n = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n[0])]

c = 0
for i in range(n[0]):
    t = True
    for j in range(n[1]):
        if a[i][j] == 0:
            t = False
            break;
    if t:
        c = c+1
r = 0
for j in range(n[1]):
    t = True
    for i in range(n[0]):
        if a[i][j]==0:
            t = False
            break;
    if t:
        r = r+1
print(r*c), In this Programming Language: Python, Now tell me if this Code is compilable or not?