def all_combos(list_of_combos: list):
	""" returns all possible combinations in a list of lists
	e.g. [[1, 2], [3, 4]] -> ["1 3", "1 4", "2 3", "2 4"]
	"""
	result = []
	# find the longest list in list_of_combos
	longest = max(list_of_combos, key=len)
	for i in range(len(longest) * (len(list_of_combos) - 1)):
		result.append([])
	for i in list_of_combos:
		iterator = 0
		# get all combinations of the list
		for j in i:
			# add to the result
			for k in range(round(len(longest) / len(i))):
				result[iterator].append(j)
				iterator += 1
	return result