






"""simple docstring"""

lowercase    			=       [
    [0, 16, 13, 0, 0, 0],
    [0, 0, 10, 12, 0, 0],
    [0, 4, 0, 0, 14, 0],
    [0, 0, 9, 0, 0, 20],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]






def _lowerCAmelCase	(  __lowerCamelCase:Optional[int] ,						__lowerCamelCase:Tuple ,						__lowerCamelCase:Tuple ,						__lowerCamelCase:Tuple   ):

						'''simple docstring'''






						__magic_name__            =     [False] * len(__lowerCamelCase   )
						__magic_name__            =     [s]
						__magic_name__            =     True

						while queue:
												__magic_name__            =     queue.pop(0   )
												for ind in range(len(graph[u]   )   ):
																		if visited[ind] is False and graph[u][ind] > 0:
																								queue.append(__lowerCamelCase   )
																								__magic_name__            =     True
																								__magic_name__            =     u

						return visited[t]






def _lowerCAmelCase	(  __lowerCamelCase:Union[str, Any] ,						__lowerCamelCase:List[Any] ,						__lowerCamelCase:Tuple   ):

						'''simple docstring'''






						__magic_name__            =     [-1] * (len(__lowerCamelCase   ))
						__magic_name__            =     0
						__magic_name__            =     []
						__magic_name__            =     [i[:] for i in graph]  # Record original cut, copy.
						while bfs(__lowerCamelCase ,						__lowerCamelCase ,						__lowerCamelCase ,						__lowerCamelCase   ):
												__magic_name__            =     float("Inf"   )
												__magic_name__            =     sink

												while s != source:
																		# Find the minimum value in select path
																		__magic_name__            =     min(__lowerCamelCase ,						graph[parent[s]][s]   )
																		__magic_name__            =     parent[s]

												max_flow += path_flow
												__magic_name__            =     sink

												while v != source:
																		__magic_name__            =     parent[v]
																		graph[u][v] -= path_flow
																		graph[v][u] += path_flow
																		__magic_name__            =     parent[v]

						for i in range(len(__lowerCamelCase   )   ):
												for j in range(len(graph[0]   )   ):
																		if graph[i][j] == 0 and temp[i][j] > 0:
																								res.append((i, j)   )

						return res


if __name__ == "__main__":
			print(mincut(test_graph, source=0, sink=5))











"""simple docstring"""

def _lowerCAmelCase	(  __lowerCamelCase:str   ):

						'''simple docstring'''






						return "".join(chr(ord(__lowerCamelCase   ) - 3_2   ) if "a" <= char <= "z" else char for char in word   )


if __name__ == "__main__":
			from doctest import testmod

			testmod()



