






def   lowerCamelCase__			(     lowercase						,     lowercase						,     lowercase				):

  """simple docstring"""






  def count_of_possible_combinations(lowercase				) -> int:
    if target < 0:
      return 0
    if target == 0:
      return 1
    return sum(count_of_possible_combinations(target - item				) for item in array				)

  return count_of_possible_combinations(lowercase				)


def   lowerCamelCase__			(     lowercase						,     lowercase						,     lowercase				):

  """simple docstring"""






  def count_of_possible_combinations_with_dp_array(
      lowercase						,     lowercase				) -> int:
    if target < 0:
      return 0
    if target == 0:
      return 1
    if dp_array[target] != -1:
      return dp_array[target]
    SCREAMING_SNAKE_CASE       :      int							=    sum(
        count_of_possible_combinations_with_dp_array(target - item						,     lowercase				)
        for item in array				)
    SCREAMING_SNAKE_CASE       :      str							=    answer
    return answer

  SCREAMING_SNAKE_CASE       :      Optional[Any]							=    [-1] * (target + 1)
  return count_of_possible_combinations_with_dp_array(lowercase						,     lowercase				)


def   lowerCamelCase__			(     lowercase						,     lowercase						,     lowercase				):

  """simple docstring"""






  SCREAMING_SNAKE_CASE       :      List[Any]							=    [0] * (target + 1)
  SCREAMING_SNAKE_CASE       :      Optional[Any]							=    1

  for i in range(1						,     target + 1				):
    for j in range(lowercase				):
      if i - array[j] >= 0:
        dp_array[i] += dp_array[i - array[j]]

  return dp_array[target]


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   snake_case    				=		3
   snake_case    				=		5
   snake_case    				=		[1, 2, 5]
   print(combination_sum_iv(n, array, target))














def   lowerCamelCase__			(     lowercase						,     lowercase				):

  """simple docstring"""






  return numa ^ numa < 0


if __name__ == "__main__":
   import doctest

   doctest.testmod()






