Table of Contents

## Not Shading solution codeforces

**Not Shading solution codeforces** – There is a grid with 𝑛n rows and 𝑚m columns. Some cells are colored black, and the rest of the cells are colored white.

In one operation, you can select some black cell and do exactly one of the following:

- color all cells in its row black, or
- color all cells in its column black.

You are given two integers 𝑟r and 𝑐c. Find the minimum number of operations required to make the cell in row 𝑟r and column 𝑐c black, or determine that it is impossible.

## Not Shading solution codeforces Input

The input consists of multiple test cases. The first line contains an integer 𝑡t (1≤𝑡≤1001≤t≤100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains four integers 𝑛n, 𝑚m, 𝑟r, and 𝑐c (1≤𝑛,𝑚≤501≤n,m≤50; 1≤𝑟≤𝑛1≤r≤n; 1≤𝑐≤𝑚1≤c≤m) — the number of rows and the number of columns in the grid, and the row and column of the cell you need to turn black, respectively.

Then 𝑛n lines follow, each containing 𝑚m characters. Each of these characters is either ‘B‘ or ‘W‘ — a black and a white cell, respectively.

## Output Not Shading solution codeforces

For each test case, if it is impossible to make the cell in row 𝑟r and column 𝑐c black, output −1−1.

Otherwise, output a single integer — the minimum number of operations required to make the cell in row 𝑟r and column 𝑐c black.

9 3 5 1 4 WBWWW BBBWB WWBBB 4 3 2 1 BWW BBW WBB WWB 2 3 2 2 WWW WWW 2 2 1 1 WW WB 5 9 5 9 WWWWWWWWW WBWBWBBBW WBBBWWBWW WBWBWBBBW WWWWWWWWW 1 1 1 1 B 1 1 1 1 W 1 2 1 1 WB 2 1 1 1 W B

1 0 -1 2 2 0 -1 1 1

### Not Shading solution codeforces Note

The first test case is pictured below.

In the third test case, it is impossible to make the cell in row 22 and column 22 black.

The fourth test case is pictured below.