



from __future__ import annotations

def        __a			(   __lowerCAmelCase      ,	__lowerCAmelCase = None   )     ->     list[list[str]]:
					SCREAMING_SNAKE_CASE							:     Dict						=				word_bank or []
					# create a table
					SCREAMING_SNAKE_CASE							:     int						=				len(__lowerCAmelCase   ) + 1

					SCREAMING_SNAKE_CASE							:     list[list[list[str]]]						=				[]
					for _ in range(__lowerCAmelCase   ):
										table.append([]   )
					# seed value
					SCREAMING_SNAKE_CASE							:     Tuple						=				[[]]  # because empty string has empty combination

					# iterate through the indices
					for i in range(__lowerCAmelCase   ):
										# condition
										if table[i] != []:
															for word in word_bank:
																				# slice condition
																				if target[i : i + len(__lowerCAmelCase   )] == word:
																									SCREAMING_SNAKE_CASE							:     list[list[str]]						=				[
																									    [word, *way] for way in table[i]
																									]
																									# adds the word to every combination the current position holds
																									# now,push that combination to the table[i+len(word)]
																									table[i + len(__lowerCAmelCase   )] += new_combinations

    # combinations are in reverse order so reverse for better output
					for combination in table[len(__lowerCAmelCase   )]:
										combination.reverse()

					return table[len(__lowerCAmelCase   )]


if __name__ == "__main__":
			print(all_construct("""jwajalapa""", ["""jwa""", """j""", """w""", """a""", """la""", """lapa"""]))
			print(all_construct("""rajamati""", ["""s""", """raj""", """amat""", """raja""", """ma""", """i""", """t"""]))
			print(
			    all_construct(
			        """hexagonosaurus""",
			        ["""h""", """ex""", """hex""", """ag""", """ago""", """ru""", """auru""", """rus""", """go""", """no""", """o""", """s"""],
			    )
			)




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))