



"""simple docstring"""
import math
import sys
class 							lowerCamelCase    :






					'''simple docstring'''





					def __init__(			self:				Dict		)  ->      str:
											snake_case_					:Optional[Any]		=     0
											snake_case_					:Dict		=     []
											snake_case_					:List[Any]		=     {}  # To store the pos of node in array






					def   lowerCAmelCase_							(			self:				Union[str, Any]		)  ->      Union[str, Any]:
											return self.cur_size == 0






					def   lowerCAmelCase_							(			self:				Optional[Any]		,	snake_case:				Optional[Any]		)  ->      str:
											snake_case_					:Optional[int]		=     self.left(snake_case		)
											snake_case_					:List[str]		=     self.right(snake_case		)
											if lc < self.cur_size and self.array(snake_case		)[0] < self.array(snake_case		)[0]:
																	snake_case_					:Any		=     lc
											else:
																	snake_case_					:List[str]		=     idx
											if rc < self.cur_size and self.array(snake_case		)[0] < self.array(snake_case		)[0]:
																	snake_case_					:Any		=     rc
											if smallest != idx:
																	self.swap(snake_case		,	snake_case		)
																	self.min_heapify(snake_case		)






					def   lowerCAmelCase_							(			self:				Any		,	snake_case:				int		)  ->      Tuple:
											# Inserts a node into the Priority Queue
											snake_case_					:List[Any]		=     self.cur_size
											self.cur_size += 1
											self.array.append((sys.maxsize, tup[1])		)
											self.decrease_key((sys.maxsize, tup[1])		,	tup[0]		)






					def   lowerCAmelCase_							(			self:				List[str]		)  ->      Any:
											# Removes and returns the min element at top of priority queue
											snake_case_					:int		=     self.array[0][1]
											snake_case_					:str		=     self.array[self.cur_size - 1]
											self.cur_size -= 1
											self.min_heapify(1		)
											del self.pos[min_node]
											return min_node






					def   lowerCAmelCase_							(			self:				Any		,	snake_case:				str		)  ->      Union[str, Any]:
											# returns the index of left child
											return 2 * i + 1






					def   lowerCAmelCase_							(			self:				Tuple		,	snake_case:				Union[str, Any]		)  ->      str:
											# returns the index of right child
											return 2 * i + 2






					def   lowerCAmelCase_							(			self:				Tuple		,	snake_case:				List[Any]		)  ->      Tuple:
											# returns the index of parent
											return math.floor(i / 2		)






					def   lowerCAmelCase_							(			self:				Tuple		,	snake_case:				List[Any]		,	snake_case:				Optional[Any]		)  ->      Any:
											# swaps array elements at indices i and j
											# update the pos{}
											snake_case_					:List[str]		=     j
											snake_case_					:Optional[int]		=     i
											snake_case_					:Optional[int]		=     self.array[i]
											snake_case_					:int		=     self.array[j]
											snake_case_					:Optional[int]		=     temp






					def   lowerCAmelCase_							(			self:				int		,	snake_case:				Tuple		,	snake_case:				Tuple		)  ->      List[Any]:
											snake_case_					:Optional[Any]		=     self.pos[tup[1]]
											# assuming the new_d is atmost old_d
											snake_case_					:List[Any]		=     (new_d, tup[1])
											while idx > 0 and self.array[self.par(snake_case		)][0] > self.array[idx][0]:
																	self.swap(snake_case		,	self.par(snake_case		)		)
																	snake_case_					:List[Any]		=     self.par(snake_case		)

class 							lowerCamelCase    :






					'''simple docstring'''





					def __init__(			self:				int		,	snake_case:				str		)  ->      List[Any]:
											snake_case_					:Optional[int]		=     {}  # To store graph: u -> (v,w)
											snake_case_					:Any		=     num  # Number of nodes in graph
											# To store the distance from source vertex
											snake_case_					:List[str]		=     [0] * self.num_nodes
											snake_case_					:Dict		=     [-1] * self.num_nodes  # To store the path






					def   lowerCAmelCase_							(			self:				Union[str, Any]		,	snake_case:				List[Any]		,	snake_case:				Dict		,	snake_case:				Any		)  ->      str:
											#  Edge going from node u to v and v to u with weight w
											# u (w)-> v, v (w) -> u
											# Check if u already in graph
											if u in self.adjList:
																	self.adjList[u].append((v, w)		)
											else:
																	snake_case_					:int		=     [(v, w)]

											# Assuming undirected graph
											if v in self.adjList:
																	self.adjList[v].append((u, w)		)
											else:
																	snake_case_					:Any		=     [(u, w)]






					def   lowerCAmelCase_							(			self:				Union[str, Any]		)  ->      List[Any]:
											# u -> v(w)
											for u in self.adjList:
																	print(snake_case		,	"""->"""		,	""" -> """.join(str(f"""{v}({w})"""		) for v, w in self.adjList[u]		)		)






					def   lowerCAmelCase_							(			self:				Any		,	snake_case:				str		)  ->      Optional[int]:
											# Flush old junk values in par[]
											snake_case_					:List[str]		=     [-1] * self.num_nodes
											# src is the source node
											snake_case_					:List[Any]		=     0
											snake_case_					:int		=     PriorityQueue()
											q.insert((0, src)		)  # (dist from src, node)
											for u in self.adjList:
																	if u != src:
																							snake_case_					:int		=     sys.maxsize  # Infinity
																							snake_case_					:List[Any]		=     -1

											while not q.is_empty():
																	snake_case_					:str		=     q.extract_min()  # Returns node with the min dist from source
																	# Update the distance of all the neighbours of u and
																	# if their prev dist was INFINITY then push them in Q
																	for v, w in self.adjList[u]:
																							snake_case_					:List[str]		=     self.dist[u] + w
																							if self.dist[v] > new_dist:
																													if self.dist[v] == sys.maxsize:
																																			q.insert((new_dist, v)		)
																													else:
																																			q.decrease_key((self.dist[v], v)		,	snake_case		)
																													snake_case_					:Any		=     new_dist
																													snake_case_					:Union[str, Any]		=     u

        # Show the shortest distances from src
											self.show_distances(snake_case		)






					def   lowerCAmelCase_							(			self:				str		,	snake_case:				str		)  ->      Tuple:
											print(f"""Distance from node: {src}"""		)
											for u in range(self.num_nodes		):
																	print(f"""Node {u} has distance: {self.dist[u]}"""		)






					def   lowerCAmelCase_							(			self:				Optional[Any]		,	snake_case:				Union[str, Any]		,	snake_case:				str		)  ->      Any:
											# To show the shortest path from src to dest
											# WARNING: Use it *after* calling dijkstra
											snake_case_					:List[str]		=     []
											snake_case_					:Optional[int]		=     0
											snake_case_					:Dict		=     dest
											# Backtracking from dest to src
											while self.par[temp] != -1:
																	path.append(snake_case		)
																	if temp != src:
																							for v, w in self.adjList[temp]:
																													if v == self.par[temp]:
																																			cost += w
																																			break
																	snake_case_					:int		=     self.par[temp]
											path.append(snake_case		)
											path.reverse()

											print(f"""----Path to reach {dest} from {src}----"""		)
											for u in path:
																	print(f"""{u}"""		,	end=""" """		)
																	if u != dest:
																							print("""-> """		,	end=""""""		)

											print("""\nTotal cost of path: """		,	snake_case		)


if __name__ == "__main__":
						__a           =							Graph(9)
						graph.add_edge(0, 1, 4)
						graph.add_edge(0, 7, 8)
						graph.add_edge(1, 2, 8)
						graph.add_edge(1, 7, 11)
						graph.add_edge(2, 3, 7)
						graph.add_edge(2, 8, 2)
						graph.add_edge(2, 5, 4)
						graph.add_edge(3, 4, 9)
						graph.add_edge(3, 5, 14)
						graph.add_edge(4, 5, 10)
						graph.add_edge(5, 6, 2)
						graph.add_edge(6, 7, 1)
						graph.add_edge(6, 8, 6)
						graph.add_edge(7, 8, 7)
						graph.show_graph()
						graph.dijkstra(0)
						graph.show_path(0, 4)

# OUTPUT
# 0 -> 1(4) -> 7(8)
# 1 -> 0(4) -> 2(8) -> 7(11)
# 7 -> 0(8) -> 1(11) -> 6(1) -> 8(7)
# 2 -> 1(8) -> 3(7) -> 8(2) -> 5(4)
# 3 -> 2(7) -> 4(9) -> 5(14)
# 8 -> 2(2) -> 6(6) -> 7(7)
# 5 -> 2(4) -> 3(14) -> 4(10) -> 6(2)
# 4 -> 3(9) -> 5(10)
# 6 -> 5(2) -> 7(1) -> 8(6)
# Distance from node: 0
# Node 0 has distance: 0
# Node 1 has distance: 4
# Node 2 has distance: 12
# Node 3 has distance: 19
# Node 4 has distance: 21
# Node 5 has distance: 11
# Node 6 has distance: 9
# Node 7 has distance: 8
# Node 8 has distance: 14
# ----Path to reach 4 from 0----
# 0 -> 7 -> 6 -> 5 -> 4
# Total cost of path:  21





"""simple docstring"""
import colorsys
import io

import cva
import matplotlib as mpl
import matplotlib.colors as mplc
import matplotlib.figure as mplfigure
import numpy as np
import torch
from matplotlib.backends.backend_agg import FigureCanvasAgg

from utils import img_tensorize


__a           =							10_00
class 							lowerCamelCase    :






					'''simple docstring'''





					def __init__(			self:				Dict		,	snake_case:				List[str]		,	snake_case:				Optional[int]=1.2		,	snake_case:				List[Any]="g"		,	snake_case:				Dict=0.5		,	snake_case:				Dict="-"		,	snake_case:				Tuple="test_out.jpg"		,	snake_case:				List[str]=True		,	snake_case:				List[Any]=False		,	snake_case:				List[str]=None		,	snake_case:				int=None		,	snake_case:				Tuple=0.7		,	)  ->      Optional[int]:
											if isinstance(snake_case		,	torch.Tensor		):
																	snake_case_					:Union[str, Any]		=     img.numpy().astype("""np.uint8"""		)
											if isinstance(snake_case		,	snake_case		):
																	snake_case_					:Optional[Any]		=     img_tensorize(snake_case		)
											assert isinstance(snake_case		,	np.ndarray		)

											snake_case_,			snake_case_					:Dict		=     img.shape[1], img.shape[0]
											snake_case_					:List[Any]		=     mplfigure.Figure(frameon=snake_case		)
											snake_case_					:Any		=     fig.get_dpi()
											snake_case_					:Tuple		=     (width * scale + 1E-2) / dpi
											snake_case_					:Any		=     (height * scale + 1E-2) / dpi
											fig.set_size_inches(snake_case		,	snake_case		)
											snake_case_					:str		=     fig.add_axes([0.0, 0.0, 1.0, 1.0]		)
											ax.axis("""off"""		)
											ax.set_xlim(0.0		,	snake_case		)
											ax.set_ylim(snake_case		)

											snake_case_					:str		=     saveas
											snake_case_					:str		=     rgb
											snake_case_					:Any		=     pynb
											snake_case_					:List[str]		=     img
											snake_case_					:Dict		=     edgecolor
											snake_case_					:Any		=     0.5
											snake_case_					:Dict		=     linestyle
											snake_case_					:Optional[Any]		=     int(np.sqrt(min(snake_case		,	snake_case		)		) * scale // 3		)
											snake_case_					:Optional[Any]		=     width
											snake_case_					:List[str]		=     height
											snake_case_					:int		=     scale
											snake_case_					:Tuple		=     fig
											snake_case_					:Any		=     ax
											snake_case_					:Union[str, Any]		=     pad
											snake_case_					:Dict		=     idaobj
											snake_case_					:Any		=     idaattr
											snake_case_					:Any		=     FigureCanvasAgg(snake_case		)






					def   lowerCAmelCase_							(			self:				int		,	snake_case:				Dict		,	snake_case:				Any=None		)  ->      List[str]:
											if color is None:
																	snake_case_					:Any		=     self.edgecolor
											((snake_case_),			(snake_case_),			(snake_case_),			(snake_case_))					:List[Any]		=     box
											snake_case_					:Union[str, Any]		=     xa - xa
											snake_case_					:Dict		=     ya - ya
											self.ax.add_patch(
											    mpl.patches.Rectangle(
											        (xa, ya)		,	snake_case		,	snake_case		,	fill=snake_case		,	edgecolor=snake_case		,	linewidth=self.font_size // 3		,	alpha=self.alpha		,	linestyle=self.linestyle		,	)		)






					def   lowerCAmelCase_							(			self:				Dict		,	snake_case:				Union[str, Any]		,	snake_case:				Union[str, Any]=None		,	snake_case:				Any=None		,	snake_case:				List[str]=None		,	snake_case:				int=None		)  ->      Any:
											if len(boxes.shape		) > 2:
																	snake_case_					:str		=     boxes[0]
											if len(obj_ids.shape		) > 1:
																	snake_case_					:Optional[int]		=     obj_ids[0]
											if len(obj_scores.shape		) > 1:
																	snake_case_					:Union[str, Any]		=     obj_scores[0]
											if len(attr_ids.shape		) > 1:
																	snake_case_					:Union[str, Any]		=     attr_ids[0]
											if len(attr_scores.shape		) > 1:
																	snake_case_					:Optional[int]		=     attr_scores[0]
											if isinstance(snake_case		,	torch.Tensor		):
																	snake_case_					:str		=     boxes.numpy()
											if isinstance(snake_case		,	snake_case		):
																	snake_case_					:List[str]		=     np.array(snake_case		)
											assert isinstance(snake_case		,	np.ndarray		)
											snake_case_					:Optional[int]		=     np.prod(boxes[:, 2:] - boxes[:, :2]		,	axis=1		)
											snake_case_					:Optional[int]		=     np.argsort(-areas		).tolist()
											snake_case_					:int		=     boxes[sorted_idxs] if boxes is not None else None
											snake_case_					:Optional[int]		=     obj_ids[sorted_idxs] if obj_ids is not None else None
											snake_case_					:int		=     obj_scores[sorted_idxs] if obj_scores is not None else None
											snake_case_					:str		=     attr_ids[sorted_idxs] if attr_ids is not None else None
											snake_case_					:Any		=     attr_scores[sorted_idxs] if attr_scores is not None else None

											snake_case_					:Union[str, Any]		=     [self._random_color(maximum=1		) for _ in range(len(snake_case		)		)]
											snake_case_					:List[Any]		=     [assigned_colors[idx] for idx in sorted_idxs]
											if obj_ids is not None:
																	snake_case_					:Optional[int]		=     self._create_text_labels_attr(snake_case		,	snake_case		,	snake_case		,	snake_case		)
																	for i in range(len(snake_case		)		):
																							snake_case_					:Any		=     assigned_colors[i]
																							self.add_box(boxes[i]		,	snake_case		)
																							self.draw_labels(labels[i]		,	boxes[i]		,	snake_case		)






					def   lowerCAmelCase_							(			self:				Any		,	snake_case:				Dict		,	snake_case:				str		,	snake_case:				Any		)  ->      Union[str, Any]:
											snake_case_,			snake_case_,			snake_case_,			snake_case_					:Optional[int]		=     box
											snake_case_					:Dict		=     (xa, ya)
											snake_case_					:Union[str, Any]		=     (ya - ya) * (xa - xa)
											snake_case_					:Optional[Any]		=     _SMALL_OBJ * self.scale
											if instance_area < small or ya - ya < 40 * self.scale:
																	if ya >= self.height - 5:
																							snake_case_					:str		=     (xa, ya)
																	else:
																							snake_case_					:Any		=     (xa, ya)

											snake_case_					:Optional[Any]		=     (ya - ya) / np.sqrt(self.height * self.width		)
											snake_case_					:Dict		=     self._change_color_brightness(snake_case		,	brightness_factor=0.7		)
											snake_case_					:List[Any]		=     np.clip((height_ratio - 0.0_2) / 0.0_8 + 1		,	1.2		,	2		)
											font_size *= 0.7_5 * self.font_size

											self.draw_text(
											    text=snake_case		,	position=snake_case		,	color=snake_case		,	)






					def   lowerCAmelCase_							(			self:				List[str]		,	snake_case:				Union[str, Any]		,	snake_case:				Optional[int]		,	snake_case:				Union[str, Any]="g"		,	snake_case:				Tuple="left"		,	)  ->      str:
											snake_case_					:Optional[Any]		=     0
											snake_case_					:Union[str, Any]		=     self.font_size
											snake_case_					:Any		=     np.maximum(list(mplc.to_rgb(snake_case		)		)		,	0.2		)
											snake_case_					:Optional[Any]		=     max(0.8		,	np.max(snake_case		)		)
											snake_case_					:List[str]		=     {
											    """facecolor""": """black""",
											    """alpha""": self.alpha,
											    """pad""": self.pad,
											    """edgecolor""": """none""",
											}
											snake_case_,			snake_case_					:Optional[int]		=     position
											self.ax.text(
											    snake_case		,	snake_case		,	snake_case		,	size=font_size * self.scale		,	family="""sans-serif"""		,	bbox=snake_case		,	verticalalignment="""top"""		,	horizontalalignment=snake_case		,	color=snake_case		,	zorder=10		,	rotation=snake_case		,	)






					def   lowerCAmelCase_							(			self:				Union[str, Any]		,	snake_case:				Tuple=None		)  ->      Dict:
											if saveas is None:
																	snake_case_					:int		=     self.saveas
											if saveas.lower().endswith(""".jpg"""		) or saveas.lower().endswith(""".png"""		):
																	cva.imwrite(
																	    snake_case		,	self._get_buffer()[:, :, ::-1]		,	)
											else:
																	self.fig.savefig(snake_case		)






					def   lowerCAmelCase_							(			self:				str		,	snake_case:				List[Any]		,	snake_case:				Dict		,	snake_case:				Any		,	snake_case:				Tuple		)  ->      Dict:
											snake_case_					:int		=     [self.idaobj[i] for i in classes]
											snake_case_					:List[str]		=     [self.idaattr[i] for i in attr_classes]
											snake_case_					:List[str]		=     [
											    f"""{label} {score:.2f} {attr} {attr_score:.2f}"""
											    for label, score, attr, attr_score in zip(snake_case		,	snake_case		,	snake_case		,	snake_case		)
											]
											return labels






					def   lowerCAmelCase_							(			self:				Dict		,	snake_case:				Any		,	snake_case:				Dict		)  ->      Tuple:
											snake_case_					:Union[str, Any]		=     [self.idaobj[i] for i in classes]
											if scores is not None:
																	if labels is None:
																							snake_case_					:List[Any]		=     ["""{:.0f}%""".format(s * 100		) for s in scores]
																	else:
																							snake_case_					:Tuple		=     ["""{} {:.0f}%""".format(snake_case		,	s * 100		) for li, s in zip(snake_case		,	snake_case		)]
											return labels






					def   lowerCAmelCase_							(			self:				str		,	snake_case:				str=255		)  ->      List[str]:
											snake_case_					:Optional[Any]		=     np.random.randint(0		,	len(_COLORS		)		)
											snake_case_					:int		=     _COLORS[idx] * maximum
											if not self.rgb:
																	snake_case_					:List[Any]		=     ret[::-1]
											return ret






					def   lowerCAmelCase_							(			self:				Optional[int]		)  ->      Union[str, Any]:
											if not self.pynb:
																	snake_case_,			snake_case_					:str		=     self.canvas.print_to_buffer()
																	if (width, height) != (self.width, self.height):
																							snake_case_					:Optional[int]		=     cva.resize(self.img		,	(width, height)		)
																	else:
																							snake_case_					:List[Any]		=     self.img
											else:
																	snake_case_					:List[Any]		=     io.BytesIO()  # works for cairo backend
																	self.canvas.print_rgba(snake_case		)
																	snake_case_,			snake_case_					:Tuple		=     self.width, self.height
																	snake_case_					:Any		=     buf.getvalue()
																	snake_case_					:List[str]		=     self.img

											snake_case_					:Optional[int]		=     np.frombuffer(snake_case		,	dtype="""uint8"""		)
											snake_case_					:Optional[Any]		=     buffer.reshape(snake_case		,	snake_case		,	4		)
											snake_case_,			snake_case_					:Tuple		=     np.split(snake_case		,	[3]		,	axis=2		)

											try:
																	import numexpr as ne  # fuse them with numexpr

																	snake_case_					:Any		=     ne.evaluate("""img * (1 - alpha / 255.0) + rgb * (alpha / 255.0)"""		)
											except ImportError:
																	snake_case_					:Union[str, Any]		=     alpha.astype("""float32"""		) / 2_5_5.0
																	snake_case_					:int		=     img * (1 - alpha) + rgb * alpha

											return visualized_image.astype("""uint8"""		)






					def   lowerCAmelCase_							(			self:				Optional[Any]		,	snake_case:				int		,	snake_case:				Optional[Any]		)  ->      Tuple:
											assert brightness_factor >= -1.0 and brightness_factor <= 1.0
											snake_case_					:int		=     mplc.to_rgb(snake_case		)
											snake_case_					:List[Any]		=     colorsys.rgb_to_hls(*mplc.to_rgb(snake_case		)		)
											snake_case_					:Optional[Any]		=     polygon_color[1] + (brightness_factor * polygon_color[1])
											snake_case_					:List[str]		=     0.0 if modified_lightness < 0.0 else modified_lightness
											snake_case_					:Dict		=     1.0 if modified_lightness > 1.0 else modified_lightness
											snake_case_					:int		=     colorsys.hls_to_rgb(polygon_color[0]		,	snake_case		,	polygon_color[2]		)
											return modified_color

__a           =							(
    np.array(
        [
            0.0_00,
            0.4_47,
            0.7_41,
            0.8_50,
            0.3_25,
            0.0_98,
            0.9_29,
            0.6_94,
            0.1_25,
            0.4_94,
            0.1_84,
            0.5_56,
            0.4_66,
            0.6_74,
            0.1_88,
            0.3_01,
            0.7_45,
            0.9_33,
            0.6_35,
            0.0_78,
            0.1_84,
            0.3_00,
            0.3_00,
            0.3_00,
            0.6_00,
            0.6_00,
            0.6_00,
            1.0_00,
            0.0_00,
            0.0_00,
            1.0_00,
            0.5_00,
            0.0_00,
            0.7_49,
            0.7_49,
            0.0_00,
            0.0_00,
            1.0_00,
            0.0_00,
            0.0_00,
            0.0_00,
            1.0_00,
            0.6_67,
            0.0_00,
            1.0_00,
            0.3_33,
            0.3_33,
            0.0_00,
            0.3_33,
            0.6_67,
            0.0_00,
            0.3_33,
            1.0_00,
            0.0_00,
            0.6_67,
            0.3_33,
            0.0_00,
            0.6_67,
            0.6_67,
            0.0_00,
            0.6_67,
            1.0_00,
            0.0_00,
            1.0_00,
            0.3_33,
            0.0_00,
            1.0_00,
            0.6_67,
            0.0_00,
            1.0_00,
            1.0_00,
            0.0_00,
            0.0_00,
            0.3_33,
            0.5_00,
            0.0_00,
            0.6_67,
            0.5_00,
            0.0_00,
            1.0_00,
            0.5_00,
            0.3_33,
            0.0_00,
            0.5_00,
            0.3_33,
            0.3_33,
            0.5_00,
            0.3_33,
            0.6_67,
            0.5_00,
            0.3_33,
            1.0_00,
            0.5_00,
            0.6_67,
            0.0_00,
            0.5_00,
            0.6_67,
            0.3_33,
            0.5_00,
            0.6_67,
            0.6_67,
            0.5_00,
            0.6_67,
            1.0_00,
            0.5_00,
            1.0_00,
            0.0_00,
            0.5_00,
            1.0_00,
            0.3_33,
            0.5_00,
            1.0_00,
            0.6_67,
            0.5_00,
            1.0_00,
            1.0_00,
            0.5_00,
            0.0_00,
            0.3_33,
            1.0_00,
            0.0_00,
            0.6_67,
            1.0_00,
            0.0_00,
            1.0_00,
            1.0_00,
            0.3_33,
            0.0_00,
            1.0_00,
            0.3_33,
            0.3_33,
            1.0_00,
            0.3_33,
            0.6_67,
            1.0_00,
            0.3_33,
            1.0_00,
            1.0_00,
            0.6_67,
            0.0_00,
            1.0_00,
            0.6_67,
            0.3_33,
            1.0_00,
            0.6_67,
            0.6_67,
            1.0_00,
            0.6_67,
            1.0_00,
            1.0_00,
            1.0_00,
            0.0_00,
            1.0_00,
            1.0_00,
            0.3_33,
            1.0_00,
            1.0_00,
            0.6_67,
            1.0_00,
            0.3_33,
            0.0_00,
            0.0_00,
            0.5_00,
            0.0_00,
            0.0_00,
            0.6_67,
            0.0_00,
            0.0_00,
            0.8_33,
            0.0_00,
            0.0_00,
            1.0_00,
            0.0_00,
            0.0_00,
            0.0_00,
            0.1_67,
            0.0_00,
            0.0_00,
            0.3_33,
            0.0_00,
            0.0_00,
            0.5_00,
            0.0_00,
            0.0_00,
            0.6_67,
            0.0_00,
            0.0_00,
            0.8_33,
            0.0_00,
            0.0_00,
            1.0_00,
            0.0_00,
            0.0_00,
            0.0_00,
            0.1_67,
            0.0_00,
            0.0_00,
            0.3_33,
            0.0_00,
            0.0_00,
            0.5_00,
            0.0_00,
            0.0_00,
            0.6_67,
            0.0_00,
            0.0_00,
            0.8_33,
            0.0_00,
            0.0_00,
            1.0_00,
            0.0_00,
            0.0_00,
            0.0_00,
            0.1_43,
            0.1_43,
            0.1_43,
            0.8_57,
            0.8_57,
            0.8_57,
            1.0_00,
            1.0_00,
            1.0_00,
        ]
    )
    .astype(np.floataa)
    .reshape(-1, 3)
)
