code: 
  """simple docstring"""
  from __future__ import annotations
  
  import sys
  
  
  
  
  def     __lowerCamelCase  (		UpperCamelCase__				,     UpperCamelCase__      ):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	if abs(UpperCamelCase__      ) == 1:
  		return a, 0
  	elif abs(UpperCamelCase__      ) == 1:
  		return 0, b
  
  	_UpperCAmelCase ,      _UpperCAmelCase =						a, b
  	_UpperCAmelCase ,      _UpperCAmelCase =						1, 0
  	_UpperCAmelCase ,      _UpperCAmelCase =						0, 1
  
  	while remainder != 0:
  		_UpperCAmelCase =						old_remainder // remainder
  		_UpperCAmelCase ,      _UpperCAmelCase =						remainder, old_remainder - quotient * remainder
  		_UpperCAmelCase ,      _UpperCAmelCase =						coeff_a, old_coeff_a - quotient * coeff_a
  		_UpperCAmelCase ,      _UpperCAmelCase =						coeff_b, old_coeff_b - quotient * coeff_b
  
  	# sign correction for negative numbers
  	if a < 0:
  		_UpperCAmelCase =						-old_coeff_a
  	if b < 0:
  		_UpperCAmelCase =						-old_coeff_b
  
  	return old_coeff_a, old_coeff_b
  
  
  
  
  def     __lowerCamelCase  (		):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	if len(sys.argv      ) < 3:
  		print("2 integer arguments required"      )
  		return 1
  	_UpperCAmelCase =						int(sys.argv[1]      )
  	_UpperCAmelCase =						int(sys.argv[2]      )
  	print(extended_euclidean_algorithm(UpperCamelCase__				,     UpperCamelCase__      )      )
  	return 0
  
  
  if __name__ == "__main__":
  			raise SystemExit(main())
  
  
  
  
style_context: 
  """simple docstring"""
  import heapq
  
  
  
  
  def     __lowerCamelCase  (		UpperCamelCase__				,     UpperCamelCase__				,     UpperCamelCase__      ):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	_UpperCAmelCase =						[(0, start)]  # cost from start node,end node
  	_UpperCAmelCase =						set()
  	while heap:
  		((_UpperCAmelCase) ,      (_UpperCAmelCase)) =						heapq.heappop(UpperCamelCase__      )
  		if u in visited:
  			continue
  		visited.add(UpperCamelCase__      )
  		if u == end:
  			return cost
  		for v, c in graph[u]:
  			if v in visited:
  				continue
  			_UpperCAmelCase =						cost + c
  			heapq.heappush(UpperCamelCase__				,     (next_item, v)      )
  	return -1
  
  
  __magic_name__		       =				{
      '''A''': [['''B''', 2], ['''C''', 5]],
      '''B''': [['''A''', 2], ['''D''', 3], ['''E''', 1], ['''F''', 1]],
      '''C''': [['''A''', 5], ['''F''', 3]],
      '''D''': [['''B''', 3]],
      '''E''': [['''B''', 4], ['''F''', 3]],
      '''F''': [['''C''', 3], ['''E''', 3]],
  }
  __magic_name__		       =				{
      '''B''': [['''C''', 1]],
      '''C''': [['''D''', 1]],
      '''D''': [['''F''', 1]],
      '''E''': [['''B''', 1], ['''F''', 3]],
      '''F''': [],
  }
  __magic_name__		       =				{
      '''B''': [['''C''', 1]],
      '''C''': [['''D''', 1]],
      '''D''': [['''F''', 1]],
      '''E''': [['''B''', 1], ['''G''', 2]],
      '''F''': [],
      '''G''': [['''F''', 1]],
  }
  
  __magic_name__		       =				dijkstra(G, '''E''', '''C''')
  print(short_distance)  # E -- 3 --> F -- 3 --> C == 6
  
  __magic_name__		       =				dijkstra(Ga, '''E''', '''F''')
  print(short_distance)  # E -- 3 --> F == 3
  
  __magic_name__		       =				dijkstra(Ga, '''E''', '''F''')
  print(short_distance)  # E -- 2 --> G -- 1 --> F == 3
  
  if __name__ == "__main__":
  			import doctest
  
  			doctest.testmod()
  
  
  
  
  