def       __lowerCAmelCase      (						A       ,     A    ):
	if a < 0 or b < 0:
		raise ValueError("the value of both inputs must be positive"    )

	UpperCAmelCase_       				=			str(bin(A    )    )[2:]  # remove the leading "0b"
	UpperCAmelCase_       				=			str(bin(A    )    )[2:]  # remove the leading "0b"

	UpperCAmelCase_       				=			max(len(A    )       ,     len(A    )    )

	return "0b" + "".join(
	    str(int(char_a == "1" and char_b == "1"    )    )
	    for char_a, char_b in zip(a_binary.zfill(A    )       ,     b_binary.zfill(A    )    )    )


if __name__ == "__main__":
				import doctest

				doctest.testmod()


from __future__ import annotations



def       __lowerCAmelCase      (						A       ,     A    ):
	print(F"Vertex\tShortest Distance from vertex {src}"    )
	for i, d in enumerate(A    ):
		print(F"{i}\t\t{d}"    )



def       __lowerCAmelCase      (						A       ,     A       ,     A    ):
	for j in range(A    ):
		UpperCAmelCase_				,   UpperCAmelCase_				,   UpperCAmelCase_       				=			(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       __lowerCAmelCase      (						A       ,     A       ,     A       ,     A    ):
	UpperCAmelCase_       				=			[float("inf"    )] * vertex_count
	UpperCAmelCase_       				=			0.0

	for _ in range(vertex_count - 1    ):
		for j in range(A    ):
			UpperCAmelCase_				,   UpperCAmelCase_				,   UpperCAmelCase_       				=			(graph[j][k] for k in ["src", "dst", "weight"])

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

	UpperCAmelCase_       				=			check_negative_cycle(A       ,     A       ,     A    )
	if negative_cycle_exists:
		raise Exception("Negative cycle found"    )

	return distance


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				_a:    List[str] 							=			int(input("""Enter number of vertices: """).strip())
				_a:    str 							=			int(input("""Enter number of edges: """).strip())

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

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

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