


def       _a			(				SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




		if len(SCREAMING_SNAKE_CASE					) <= 1:
				return [tuple(SCREAMING_SNAKE_CASE					)]

		lowercase__						=				[]

		def generate(SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE					):
				if k == 1:
						res.append(tuple(arr[:]					)					)
						return

				generate(k - 1						,    SCREAMING_SNAKE_CASE					)

				for i in range(k - 1					):
						if k % 2 == 0:  # k is even
								lowercase__					,		lowercase__						=				arr[k - 1], arr[i]
						else:  # k is odd
								lowercase__					,		lowercase__						=				arr[k - 1], arr[0]
						generate(k - 1						,    SCREAMING_SNAKE_CASE					)

		generate(len(SCREAMING_SNAKE_CASE					)						,    SCREAMING_SNAKE_CASE					)
		return res


if __name__ == "__main__":
			lowerCAmelCase	=							input('Enter numbers separated by a comma:\n').strip()
			lowerCAmelCase	=							[int(item) for item in user_input.split(',')]
			print(heaps(arr))






def       _a			(				SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE					):


		"""simple docstring"""




		lowercase__						=				len(SCREAMING_SNAKE_CASE					)
		lowercase__						=				[]
		for i in range(len(SCREAMING_SNAKE_CASE					) - pat_len + 1					):
				lowercase__						=				True
				for j in range(SCREAMING_SNAKE_CASE					):
						if s[i + j] != pattern[j]:
								lowercase__						=				False
								break
				if match_found:
						position.append(SCREAMING_SNAKE_CASE					)
		return position


if __name__ == "__main__":
			assert naive_pattern_search('ABCDEFG', 'DE') == [3]
			print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))


