from __future__ import annotations






def       __lowerCamelCase		(						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:
              lowerCAmelCase__     	=					capacity - weights[counter - 1]
              lowerCAmelCase__     	=					values[counter - 1] + knapsack(
                  lowerCAmelCase__	,  lowerCAmelCase__	,  lowerCAmelCase__	,  counter - 1	)
              lowerCAmelCase__     	=					knapsack(lowerCAmelCase__	,  lowerCAmelCase__	,  lowerCAmelCase__	,  counter - 1	)
              return max(lowerCAmelCase__	,  lowerCAmelCase__	)


if __name__ == "__main__":
    import doctest

    doctest.testmod()







def 			lowerCamelCase_		(					lowerCAmelCase:		list			,							lowerCAmelCase:		list )->						list:
  _snake_case      : int														=		len(lowerCAmelCase )
  _snake_case      : int														=		len(lowerCAmelCase )
  _snake_case      : int														=		(
      first_input_list_length
      if first_input_list_length > second_input_list_length
      else second_input_list_length
  )
  _snake_case      : list														=		[]
  for char_count in range(lowerCAmelCase ):
    if char_count < first_input_list_length:
      output_result_list.append(first_input_list[char_count] )
    if char_count < second_input_list_length:
      output_result_list.append(second_input_list[char_count] )

  return output_result_list


if __name__ == "__main__":
      print(alternative_list_arrange(["""A""", """B""", """C"""], [1, 2, 3, 4, 5]), end=""" """)




