






UpperCAmelCase__							  =						[
    (1000, '''M'''),
    (900, '''CM'''),
    (500, '''D'''),
    (400, '''CD'''),
    (100, '''C'''),
    (90, '''XC'''),
    (50, '''L'''),
    (40, '''XL'''),
    (10, '''X'''),
    (9, '''IX'''),
    (5, '''V'''),
    (4, '''IV'''),
    (1, '''I'''),
]
def 		_a       ( a					:str					)				->     int:
 a						    = {'''I''': 1, '''V''': 5, '''X''': 10, '''L''': 50, '''C''': 100, '''D''': 500, '''M''': 1_000}
 a						    = 0
 a						    = 0
 while place < len(a					):
  if (place + 1 < len(a					)) and (vals[roman[place]] < vals[roman[place + 1]]):
   total += vals[roman[place + 1]] - vals[roman[place]]
   place += 2
  else:
   total += vals[roman[place]]
   place += 1
 return total
def 		_a       ( a					:Optional[Any]					)				->     str:
 a						    = []
 for arabic, roman in ROMAN:
  ((a)    ,	(a))						    = divmod(a      ,				a					)
  result.append(roman * factor					)
  if number == 0:
   break
 return "".join(a					)


if __name__ == "__main__":
     import doctest

     doctest.testmod()









def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case						,   snake_case						,   snake_case							)		->    int:
		# Return True if there is node that has not iterated.
		__lowercase											=     [False] * len(snake_case							)
		__lowercase											=     []
		queue.append(snake_case							)
		__lowercase											=     True

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

		return visited[t]



def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case						,   snake_case							)		->    Dict:
		# This array is filled by BFS and to store path
		__lowercase											=     [-1] * (len(snake_case							))
		__lowercase											=     0
		while bfs(snake_case						,   snake_case						,   snake_case						,   snake_case							):
				__lowercase											=     float('Inf'							)
				__lowercase											=     sink

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

				max_flow += path_flow
				__lowercase											=     sink

				while v != source:
						__lowercase											=     parent[v]
						graph[u][v] -= path_flow
						graph[v][u] += path_flow
						__lowercase											=     parent[v]
		return max_flow


SCREAMING_SNAKE_CASE_   :      Any			=   [
    [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],
]

SCREAMING_SNAKE_CASE_	,SCREAMING_SNAKE_CASE_   :      Optional[Any]			=   0, 5


print(ford_fulkerson(graph, source, sink))




