



def        __a			(   __lowerCAmelCase   )     ->     List[str]:
					stooge(__lowerCAmelCase      ,	0      ,	len(__lowerCAmelCase   ) - 1   )
					return arr

def        __a			(   __lowerCAmelCase      ,	__lowerCAmelCase      ,	__lowerCAmelCase   )     ->     int:
					if i >= h:
										return

					# If first element is smaller than the last then swap them
					if arr[i] > arr[h]:
										SCREAMING_SNAKE_CASE					,  SCREAMING_SNAKE_CASE							:     Any						=				arr[h], arr[i]

					# If there are more than 2 elements in the array
					if h - i + 1 > 2:
										SCREAMING_SNAKE_CASE							:     Union[str, Any]						=				(int)((h - i + 1) / 3   )

										# Recursively sort first 2/3 elements
										stooge(__lowerCAmelCase      ,	__lowerCAmelCase      ,	(h - t)   )

										# Recursively sort last 2/3 elements
										stooge(__lowerCAmelCase      ,	i + t      ,	(__lowerCAmelCase)   )

										# Recursively sort first 2/3 elements
										stooge(__lowerCAmelCase      ,	__lowerCAmelCase      ,	(h - t)   )


if __name__ == "__main__":
			_lowerCamelCase    :		List[str]		      =    input("""Enter numbers separated by a comma:\n""").strip()
			_lowerCamelCase    :		List[Any]		      =    [int(item) for item in user_input.split(""",""")]
			print(stooge_sort(unsorted))




def        __a			(   __lowerCAmelCase   )     ->     list[list[float]]:
					SCREAMING_SNAKE_CASE							:     list[list[float]]						=				[]
					for data in source_data:
										for i, el in enumerate(__lowerCAmelCase   ):
															if len(__lowerCAmelCase   ) < i + 1:
																				data_lists.append([]   )
															data_lists[i].append(float(__lowerCAmelCase   )   )
					return data_lists

def        __a			(   __lowerCAmelCase      ,	__lowerCAmelCase   )     ->     list[list[float]]:
					SCREAMING_SNAKE_CASE							:     list[list[float]]						=				[]
					for dlist, weight in zip(__lowerCAmelCase      ,	__lowerCAmelCase   ):
										SCREAMING_SNAKE_CASE							:     str						=				min(__lowerCAmelCase   )
										SCREAMING_SNAKE_CASE							:     int						=				max(__lowerCAmelCase   )

										SCREAMING_SNAKE_CASE							:     list[float]						=				[]
										# for weight 0 score is 1 - actual score
										if weight == 0:
															for item in dlist:
																				try:
																									score.append(1 - ((item - mind) / (maxd - mind))   )
																				except ZeroDivisionError:
																									score.append(1   )

										elif weight == 1:
															for item in dlist:
																				try:
																									score.append((item - mind) / (maxd - mind)   )
																				except ZeroDivisionError:
																									score.append(0   )

        # weight not 0 or 1
										else:
															SCREAMING_SNAKE_CASE							:     Union[str, Any]						=				F'''Invalid weight of {weight:f} provided'''
															raise ValueError(__lowerCAmelCase   )

										score_lists.append(__lowerCAmelCase   )

					return score_lists

def        __a			(   __lowerCAmelCase   )     ->     list[float]:
					SCREAMING_SNAKE_CASE							:     list[float]						=				[0 for i in range(len(score_lists[0]   )   )]

					for slist in score_lists:
										for j, ele in enumerate(__lowerCAmelCase   ):
															SCREAMING_SNAKE_CASE							:     str						=				final_scores[j] + ele

					return final_scores



def        __a			(   __lowerCAmelCase      ,	__lowerCAmelCase   )     ->     list[list[float]]:
					SCREAMING_SNAKE_CASE							:     Tuple						=				get_data(__lowerCAmelCase   )
					SCREAMING_SNAKE_CASE							:     List[str]						=				calculate_each_score(__lowerCAmelCase      ,	__lowerCAmelCase   )
					SCREAMING_SNAKE_CASE							:     str						=				generate_final_scores(__lowerCAmelCase   )

					# append scores to source data
					for i, ele in enumerate(__lowerCAmelCase   ):
										source_data[i].append(__lowerCAmelCase   )

					return source_data