Given an m by n grid picture of characters where each element is either 'W' representing white or 'B' representing black, and an integer target, return the total number of black pixels picture[r][c] that satisfy the following conditions:

1. Row r has exactly target black pixels.

2. Column c has exactly target black pixels.

3. All rows containing a black pixel at column c are completely identical to row r.

Constraints:

• m == picture.length

• n == picture[i].length

• $1 \leq$ m, n $\leq 200$

• picture[i][j] is 'W' or 'B'.

• $1 \leq$ target $\leq \min($ m, n $)$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.