






"""simple docstring"""







def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_):
					a__ 							=	0
					for plain_chr in plain_text:
										a__ 							=	(
										    ord(lowerCamelCase_) + (hash_value << 6) + (hash_value << 16) - hash_value
										)
					return hash_value










"""simple docstring"""







from __future__ import annotations





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_):

					# Base Case
					if counter == 0 or capacity == 0:
										return 0

					# If weight of the nth item is more than Knapsack of capacity,
					#   then this item cannot be included in the optimal solution,
					# else return the maximum of two cases:
					#   (1) nth item included
					#   (2) not included
					if weights[counter - 1] > capacity:
										return knapsack(lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
					else:
										a__ 							=	capacity - weights[counter - 1]
										a__ 							=	values[counter - 1] + knapsack(
										    lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
										a__ 							=	knapsack(lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
										return max(lowerCamelCase_			,  lowerCamelCase_)


if __name__ == "__main__":
	import doctest

	doctest.testmod()


