'''simple docstring'''

def     __lowercase  (_lowercase,						_lowercase,						_lowercase,						_lowercase,						_lowercase,						_lowercase     )   ->     int:


     """simple docstring"""
     if index == r:
          for j in range(_lowercase     ):
               print(data[j],						end=""" """     )
          print(""" """     )
          return
     #  When no more elements are there to put in data[]
     if i >= n:
          return
     # current is included, put next at next location
     __lowerCamelCase						:       int				   =				arr[i]
     combination_util(_lowercase,						_lowercase,						_lowercase,						index + 1,						_lowercase,						i + 1     )
     # current is excluded, replace it with
     # next (Note that i+1 is passed, but
     # index is not changed)
     combination_util(_lowercase,						_lowercase,						_lowercase,						_lowercase,						_lowercase,						i + 1     )
     # The main function that prints all combinations
     # of size r in arr[] of size n. This function
     # mainly uses combinationUtil()
def     __lowercase  (_lowercase,						_lowercase,						_lowercase     )   ->     List[str]:


     """simple docstring"""
     __lowerCamelCase						:       Dict				   =				[0] * r
     # Print all combination using temporary array 'data[]'
     combination_util(_lowercase,						_lowercase,						_lowercase,						0,						_lowercase,						0     )


if __name__ == "__main__":
   # Driver code to check the function above
   UpperCAmelCase__						:List[Any]          =			[10, 20, 30, 40, 50]
   print_combination(arr, len(arr), 3)
   # This code is contributed by Ambuj sahu











'''simple docstring'''

def     __lowercase  (_lowercase,						_lowercase,						_lowercase,						_lowercase     )   ->     Union[str, Any]:


     """simple docstring"""
     # Return True if there is node that has not iterated.
     __lowerCamelCase						:       Optional[Any]				   =				[False] * len(_lowercase     )
     __lowerCamelCase						:       Dict				   =				[]
     queue.append(_lowercase     )
     __lowerCamelCase						:       Optional[int]				   =				True

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

     return visited[t]
def     __lowercase  (_lowercase,						_lowercase,						_lowercase     )   ->     Optional[Any]:


     """simple docstring"""
     # This array is filled by BFS and to store path
     __lowerCamelCase						:       Any				   =				[-1] * (len(_lowercase     ))
     __lowerCamelCase						:       Optional[int]				   =				0
     while bfs(_lowercase,						_lowercase,						_lowercase,						_lowercase     ):
          __lowerCamelCase						:       List[Any]				   =				float("""Inf"""     )
          __lowerCamelCase						:       Union[str, Any]				   =				sink

          while s != source:
               # Find the minimum value in select path
               __lowerCamelCase						:       Optional[int]				   =				min(_lowercase,						graph[parent[s]][s]     )
               __lowerCamelCase						:       Union[str, Any]				   =				parent[s]

          max_flow += path_flow
          __lowerCamelCase						:       str				   =				sink

          while v != source:
               __lowerCamelCase						:       List[Any]				   =				parent[v]
               graph[u][v] -= path_flow
               graph[v][u] += path_flow
               __lowerCamelCase						:       Dict				   =				parent[v]
     return max_flow


UpperCAmelCase__						:str          =			[
    [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],
]

UpperCAmelCase__       ,				UpperCAmelCase__						:Optional[Any]          =			0, 5
print(ford_fulkerson(graph, source, sink))



