"""simple docstring"""







import requests
def 					__lowerCAmelCase       (_UpperCamelCase ,						_UpperCamelCase	):
	__lowerCAmelCase    :		List[Any]		    =   {'Content-Type': 'application/json'}
	__lowerCAmelCase    :		str		    =   requests.post(__snake_case ,						json={'text': message_body} ,						headers=__snake_case	)
	if response.status_code != 200:
		__lowerCAmelCase    :		Optional[Any]		    =   (
		    'Request to slack returned an error '
		    F"{response.status_code}, the response is:\n{response.text}"
		)
		raise ValueError(__snake_case	)


if __name__ == "__main__":
							# Set the slack url to the one provided by Slack when you create the webhook at
							# https://my.slack.com/services/new/incoming-webhook/
							send_slack_message("""<YOUR MESSAGE BODY>""", """<SLACK CHANNEL URL>""")

"""simple docstring"""







class 				A__ :

		def __init__(   self				):
			__lowerCAmelCase    :		Optional[int]		    =   0
			__lowerCAmelCase    :		Any		    =   0
			__lowerCAmelCase    :		List[Any]		    =   {}

		def 							__lowerCamelCase							(   self ,	_SCREAMING_SNAKE_CASE				):
			if vertex not in self.adjacency:
				__lowerCAmelCase    :		Dict		    =   {}
				self.num_vertices += 1

		def 							__lowerCamelCase							(   self ,	_SCREAMING_SNAKE_CASE ,	_SCREAMING_SNAKE_CASE ,	_SCREAMING_SNAKE_CASE				):
			self.add_vertex(_SCREAMING_SNAKE_CASE				)
			self.add_vertex(_SCREAMING_SNAKE_CASE				)

			if head == tail:
				return

			__lowerCAmelCase    :		Union[str, Any]		    =   weight
			__lowerCAmelCase    :		str		    =   weight

		def 							__lowerCamelCase							(   self				):
			__lowerCAmelCase    :		int		    =   self.get_edges()
			for edge in edges:
				__lowerCAmelCase    ,     __lowerCAmelCase    ,     __lowerCAmelCase    :		Optional[Any]		    =   edge
				edges.remove((tail, head, weight)				)
			for i in range(len(_SCREAMING_SNAKE_CASE				)				):
				__lowerCAmelCase    :		List[str]		    =   list(edges[i]				)

			edges.sort(key=lambda _SCREAMING_SNAKE_CASE				: e[2]				)
			for i in range(len(_SCREAMING_SNAKE_CASE				) - 1				):
				if edges[i][2] >= edges[i + 1][2]:
					__lowerCAmelCase    :		Dict		    =   edges[i][2] + 1
			for edge in edges:
				__lowerCAmelCase    ,     __lowerCAmelCase    ,     __lowerCAmelCase    :		str		    =   edge
				__lowerCAmelCase    :		Union[str, Any]		    =   weight
				__lowerCAmelCase    :		Optional[int]		    =   weight

		def __str__(   self				):
			__lowerCAmelCase    :		List[Any]		    =   ''
			for tail in self.adjacency:
				for head in self.adjacency[tail]:
					__lowerCAmelCase    :		str		    =   self.adjacency[head][tail]
					string += f"{head} -> {tail} == {weight}\n"
			return string.rstrip('\n'				)

		def 							__lowerCamelCase							(   self				):
			__lowerCAmelCase    :		Tuple		    =   []
			for tail in self.adjacency:
				for head in self.adjacency[tail]:
					output.append((tail, head, self.adjacency[head][tail])				)
			return output

		def 							__lowerCamelCase							(   self				):
			return self.adjacency.keys()

		@staticmethod
		def 							__lowerCamelCase							(   _SCREAMING_SNAKE_CASE=None ,	_SCREAMING_SNAKE_CASE=None				):
			__lowerCAmelCase    :		List[str]		    =   Graph()
			if vertices is None:
				__lowerCAmelCase    :		int		    =   []
			if edges is None:
				__lowerCAmelCase    :		Optional[int]		    =   []
			for vertex in vertices:
				g.add_vertex(_SCREAMING_SNAKE_CASE				)
			for edge in edges:
				g.add_edge(*_SCREAMING_SNAKE_CASE				)
			return g




		class 				A__ :

				def __init__(   self				):
					__lowerCAmelCase    :		Dict		    =   {}
					__lowerCAmelCase    :		Optional[int]		    =   {}

				def __len__(   self				):
					return len(self.parent				)

				def 							__lowerCamelCase							(   self ,	_SCREAMING_SNAKE_CASE				):
					if item in self.parent:
						return self.find(_SCREAMING_SNAKE_CASE				)

					__lowerCAmelCase    :		Dict		    =   item
					__lowerCAmelCase    :		int		    =   0
					return item

				def 							__lowerCamelCase							(   self ,	_SCREAMING_SNAKE_CASE				):
					if item not in self.parent:
						return self.make_set(_SCREAMING_SNAKE_CASE				)
					if item != self.parent[item]:
						__lowerCAmelCase    :		Dict		    =   self.find(self.parent[item]				)
					return self.parent[item]







				def 							__lowerCamelCase							(   self ,	_SCREAMING_SNAKE_CASE ,	_SCREAMING_SNAKE_CASE				):
					__lowerCAmelCase    :		Any		    =   self.find(_SCREAMING_SNAKE_CASE				)
					__lowerCAmelCase    :		List[str]		    =   self.find(_SCREAMING_SNAKE_CASE				)

					if roota == roota:
						return roota

					if self.rank[roota] > self.rank[roota]:
						__lowerCAmelCase    :		Tuple		    =   roota
						return roota

					if self.rank[roota] < self.rank[roota]:
						__lowerCAmelCase    :		str		    =   roota
						return roota

					if self.rank[roota] == self.rank[roota]:
						self.rank[roota] += 1
						__lowerCAmelCase    :		Optional[int]		    =   roota
						return roota
					return None



		@staticmethod
		def 							__lowerCamelCase							(   _SCREAMING_SNAKE_CASE				):
			__lowerCAmelCase    :		Union[str, Any]		    =   graph.num_vertices

			__lowerCAmelCase    :		List[Any]		    =   Graph.UnionFind()
			__lowerCAmelCase    :		Tuple		    =   []
			while num_components > 1:
				__lowerCAmelCase    :		str		    =   {}
				for vertex in graph.get_vertices():
					__lowerCAmelCase    :		Union[str, Any]		    =   -1

				__lowerCAmelCase    :		int		    =   graph.get_edges()
				for edge in edges:
					__lowerCAmelCase    ,     __lowerCAmelCase    ,     __lowerCAmelCase    :		Union[str, Any]		    =   edge
					edges.remove((tail, head, weight)				)
				for edge in edges:
					__lowerCAmelCase    ,     __lowerCAmelCase    ,     __lowerCAmelCase    :		Any		    =   edge
					__lowerCAmelCase    :		Optional[int]		    =   union_find.find(_SCREAMING_SNAKE_CASE				)
					__lowerCAmelCase    :		str		    =   union_find.find(_SCREAMING_SNAKE_CASE				)
					if seta != seta:
						if cheap_edge[seta] == -1 or cheap_edge[seta][2] > weight:
							__lowerCAmelCase    :		List[str]		    =   [head, tail, weight]

						if cheap_edge[seta] == -1 or cheap_edge[seta][2] > weight:
							__lowerCAmelCase    :		List[str]		    =   [head, tail, weight]
				for vertex in cheap_edge:
					if cheap_edge[vertex] != -1:
						__lowerCAmelCase    ,     __lowerCAmelCase    ,     __lowerCAmelCase    :		str		    =   cheap_edge[vertex]
						if union_find.find(_SCREAMING_SNAKE_CASE				) != union_find.find(_SCREAMING_SNAKE_CASE				):
							union_find.union(_SCREAMING_SNAKE_CASE ,	_SCREAMING_SNAKE_CASE				)
							mst_edges.append(cheap_edge[vertex]				)
							__lowerCAmelCase    :		List[str]		    =   num_components - 1
			__lowerCAmelCase    :		Union[str, Any]		    =   Graph.build(edges=_SCREAMING_SNAKE_CASE				)
			return mst