
def 				a						(							snake_case__:					list						,   snake_case__:					list						,   snake_case__:					int						,   snake_case__:					int						,   snake_case__:					int					):


				'''simple docstring'''
				if index == number_of_items:
								return 0
				lowercase_       =					0
				lowercase_       =					0
				lowercase_       =					knapsack(snake_case__						,   snake_case__						,   snake_case__						,   snake_case__						,   index + 1					)
				if weights[index] <= max_weight:
								lowercase_       =					values[index] + knapsack(
								    snake_case__						,   snake_case__						,   snake_case__						,   max_weight - weights[index]						,   index + 1					)
				return max(snake_case__						,   snake_case__					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()






def 				a						(							snake_case__:					int = 100					):


				'''simple docstring'''
				lowercase_       =					(n * (n + 1) // 2) ** 2
				lowercase_       =					n * (n + 1) * (2 * n + 1) // 6
				return sum_cubes - sum_squares


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




