Not Shading
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.
The first test case is pictured below.  We can take the black cell in row $$$1$$$ and column $$$2$$$, and make all cells in its row black. Therefore, the cell in row $$$1$$$ and column $$$4$$$ will become black.  In the second test case, the cell in row $$$2$$$ and column $$$1$$$ is already black.In the third test case, it is impossible to make the cell in row $$$2$$$ and column $$$2$$$ black.The fourth test case is pictured below.  We can take the black cell in row $$$2$$$ and column $$$2$$$ and make its column black.   Then, we can take the black cell in row $$$1$$$ and column $$$2$$$ and make its row black.   Therefore, the cell in row $$$1$$$ and column $$$1$$$ will become black.
The input consists of multiple test cases. The first line contains an integer $$$t$$$ ($$$1 \leq t \leq 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 \leq n, m \leq 50$$$; $$$1 \leq r \leq n$$$; $$$1 \leq c \leq 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.
For each test case, if it is impossible to make the cell in row $$$r$$$ and column $$$c$$$ black, output $$$-1$$$. Otherwise, output a single integer — the minimum number of operations required to make the cell in row $$$r$$$ and column $$$c$$$ black. 
import sys
input = sys.stdin.readline
num_test_cases = int(input())
for test_case_ittr in range(num_test_cases):
    (num_rows, num_cols, row, col) = [int(x) for x in input().split()]
    i_row = row - 1
    j_col = col - 1
    grid = [input().strip() for i in range(num_rows)]
    if grid[i_row][j_col] == 'B':
        print(0)
        continue
    found_answer = False
    for i in range(num_rows):
        if grid[i][j_col] == 'B':
            print(1)
            found_answer = True
            break
    if found_answer:
        continue
    for j in range(num_cols):
        if grid[i_row][j] == 'B':
            print(1)
            found_answer = True
            break
    if found_answer:
        continue
    grid_has_a_black_square = False
    for i in range(num_rows):
        for j in range(num_cols):
            if grid[i][j] == 'B':
                grid_has_a_black_square = True
                break
        if grid_has_a_black_square:
            break
    print(2 if grid_has_a_black_square else -1)
for _ in range(int(input())):
    (n, m, r, c) = map(int, input().split())
    a = []
    x = 0
    for i in range(n):
        a.append(input())
    if a[r - 1][c - 1] == 'B':
        print(0)
        continue
    if 'B' in a[r - 1]:
        print(1)
        continue
    for i in a:
        if i[c - 1] == 'B':
            x = 1
            break
    if x == 1:
        print(1)
    else:
        for i in a:
            if 'B' in i:
                print(2)
                break
        else:
            print(-1)
def f():
    (n, m, r, c) = map(int, input().split())
    s = []
    z = 0
    for i in range(n):
        l = input()
        s.append(l)
        if l.find('B') != -1:
            z = 1
    if s[r - 1][c - 1] == 'B':
        print(0)
    elif z == 0:
        print(-1)
    elif s[r - 1].count('B') != 0:
        print(1)
    else:
        e = [j[c - 1] for j in s]
        if e.count('B') != 0:
            print(1)
        else:
            print(2)
t = int(input())
for i in range(t):
    f()