





def    __UpperCamelCase      (    a) ->list:
					return [
					    txt[:a] + txt[a].upper() + txt[a + 1 :]
					    for a in range(len(SCREAMING_SNAKE_CASE_))
					    if txt[a].isalpha()
					]


if __name__ == "__main__":
						__import__("doctest").testmod()








def    __UpperCamelCase      (    a,     a) ->Optional[int]:
					lowerCamelCase__       =       [1]
					for i in range(2,     a):
										factorials.append(factorials[-1] * i)
					assert 0 <= k < factorials[-1] * n, "k out of bounds"

					lowerCamelCase__       =       []
					lowerCamelCase__       =       list(range(a))

					# Find permutation
					while factorials:
										lowerCamelCase__       =       factorials.pop()
										lowerCamelCase__    ,		lowerCamelCase__       =       divmod(a,     a)
										permutation.append(elements[number])
										elements.remove(elements[number])
					permutation.append(elements[0])

					return permutation


if __name__ == "__main__":
						import doctest

						doctest.testmod()

