class Solution(object): def __init__(self): self.List = list() def bfs(self,R,C,S,V): T = list() while len(S) >0: node = S.pop(0) if node[0]-1>=0 and V[node[0]-1][node[1]] == 0: V[node[0]-1][node[1]] = 1 T.append([node[0]-1,node[1]]) self.List.appen…