"""simple docstring"""
def 		__a  (      _SCREAMING_SNAKE_CASE  )      ->int:
  return int(_SCREAMING_SNAKE_CASE  ) if x - int(_SCREAMING_SNAKE_CASE  ) <= 0 else int(_SCREAMING_SNAKE_CASE  ) + 1


if __name__ == "__main__":
 import doctest

 doctest.testmod()










from __future__ import annotations







def   snake_case		(				UpperCAmelCase						:							int,    UpperCAmelCase						:							list[int],    UpperCAmelCase						:							list[int],    UpperCAmelCase						:							int ):

				# 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(UpperCAmelCase,    UpperCAmelCase,    UpperCAmelCase,    counter - 1 )
				else:
								A									=   capacity - weights[counter - 1]
								A									=   values[counter - 1] + knapsack(
								    UpperCAmelCase,    UpperCAmelCase,    UpperCAmelCase,    counter - 1 )
								A									=   knapsack(UpperCAmelCase,    UpperCAmelCase,    UpperCAmelCase,    counter - 1 )
								return max(UpperCAmelCase,    UpperCAmelCase )


if __name__ == "__main__":
					import doctest

					doctest.testmod()





