

'''simple docstring'''



from __future__ import annotations


def       snake_case   (	snake_case      : List[Any]					,		snake_case      : int			) ->  Union[str, Any]:


    """simple docstring"""


    print(F'Vertex\tShortest Distance from vertex {src}'			)
    for i, d in enumerate(snake_case			):
        print(F'{i}\t\t{d}'			)


def       snake_case   (	snake_case      : Optional[int]					,		snake_case      : Tuple					,		snake_case      : List[Any]			) ->  Dict:


    """simple docstring"""


    for j in range(snake_case			):
        lowerCAmelCase 						=							(graph[j][k] for k in ['''src''', '''dst''', '''weight'''])
        if distance[u] != float('inf'			) and distance[u] + w < distance[v]:
            return True
    return False


def       snake_case   (	snake_case      : Union[str, Any]					,		snake_case      : Optional[Any]					,		snake_case      : str					,		snake_case      : str			) ->  str:


    """simple docstring"""


    lowerCAmelCase 						=							[float('inf'			)] * vertex_count
    lowerCAmelCase 						=							0.0

    for _ in range(vertex_count - 1			):
        for j in range(snake_case			):
            lowerCAmelCase 						=							(graph[j][k] for k in ['''src''', '''dst''', '''weight'''])

            if distance[u] != float('inf'			) and distance[u] + w < distance[v]:
                lowerCAmelCase 						=							distance[u] + w

    lowerCAmelCase 						=							check_negative_cycle(snake_case					,		snake_case					,		snake_case			)
    if negative_cycle_exists:
        raise Exception('Negative cycle found'			)

    return distance


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     _UpperCamelCase						:  Tuple							       =				int(input("Enter number of vertices: ").strip())
     _UpperCamelCase						:  Any							       =				int(input("Enter number of edges: ").strip())

     _UpperCamelCase						:  list[dict[str, int]]							       =				[{} for _ in range(E)]

     for i in range(E):
          print("Edge ", i + 1)
          _UpperCamelCase						:  Dict							       =				(
              int(x)
              for x in input("Enter source, destination, weight: ").strip().split(" ")
          )
          _UpperCamelCase						:  Dict							       =				{"""src""": src, """dst""": dest, """weight""": weight}

     _UpperCamelCase						:  List[Any]							       =				int(input("\nEnter shortest path source:").strip())
     _UpperCamelCase						:  List[str]							       =				bellman_ford(graph, V, E, source)
     print_distance(shortest_distance, 0)













import sys

SCREAMING_SNAKE_CASE__   :      Optional[Any]				=		(
    """73167176531330624919225119674426574742355349194934"""
    """96983520312774506326239578318016984801869478851843"""
    """85861560789112949495459501737958331952853208805511"""
    """12540698747158523863050715693290963295227443043557"""
    """66896648950445244523161731856403098711121722383113"""
    """62229893423380308135336276614282806444486645238749"""
    """30358907296290491560440772390713810515859307960866"""
    """70172427121883998797908792274921901699720888093776"""
    """65727333001053367881220235421809751254540594752243"""
    """52584907711670556013604839586446706324415722155397"""
    """53697817977846174064955149290862569321978468622482"""
    """83972241375657056057490261407972968652414535100474"""
    """82166370484403199890008895243450658541227588666881"""
    """16427171479924442928230863465674813919123162824586"""
    """17866458359124566529476545682848912883142607690042"""
    """24219022671055626321111109370544217506941658960408"""
    """07198403850962455444362981230987879927244284909188"""
    """84580156166097919133875499200524063689912560717606"""
    """05886116467109405077541002256983155200055935729725"""
    """71636269561882670428252483600823257530420752963450"""
)

def   __lowercase       (			snake_case = N			):







				"""simple docstring"""






				__magic_name__		:Optional[int]   =   -sys.maxsize - 1
				for i in range(len(snake_case			) - 1_2			):
								__magic_name__		:List[Any]   =   1
								for j in range(1_3			):
												product *= int(n[i + j]			)
								if product > largest_product:
												__magic_name__		:str   =   product
				return largest_product


if __name__ == "__main__":
					print(f"{solution() = }")






