

def 							__SCREAMING_SNAKE_CASE							(			lowerCAmelCase:					int = 100	)				->    int:
				_UpperCAmelCase    :						List[str]							=      0
				_UpperCAmelCase    :						Union[str, Any]							=      0
				for i in range(1					, n + 1	):
								sum_of_squares += i**2
								sum_of_ints += i
				return sum_of_ints**2 - sum_of_squares


if __name__ == "__main__":
			print(F'''{solution() = }''')





from __future__ import annotations

from random import choice

def 							__SCREAMING_SNAKE_CASE							(			lowerCAmelCase:					Any	)				->    Optional[int]:
				return choice(lowerCAmelCase	)

def 							__SCREAMING_SNAKE_CASE							(			lowerCAmelCase:					list[int]					, lowerCAmelCase:					int	)				->    int:
				_UpperCAmelCase    :						List[Any]							=      random_pivot(lowerCAmelCase	)

				# partition based on pivot
				# linear time
				_UpperCAmelCase    :						List[str]							=      [e for e in lst if e < pivot]
				_UpperCAmelCase    :						Any							=      [e for e in lst if e > pivot]

				# if we get lucky, pivot might be the element we want.
				# we can easily see this:
				# small (elements smaller than k)
				# + pivot (kth element)
				# + big (elements larger than k)
				if len(lowerCAmelCase	) == k - 1:
								return pivot
				# pivot is in elements bigger than k
				elif len(lowerCAmelCase	) < k - 1:
								return kth_number(lowerCAmelCase					, k - len(lowerCAmelCase	) - 1	)
				# pivot is in elements smaller than k
				else:
								return kth_number(lowerCAmelCase					, lowerCAmelCase	)


if __name__ == "__main__":
					import doctest

					doctest.testmod()


