




def 		__A		(	__lowerCamelCase							,			__lowerCamelCase							,			__lowerCamelCase    )      ->       Dict:

	def count_of_possible_combinations(__lowerCamelCase    ) -> 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(UpperCamelCase_    )





def 		__A		(	__lowerCamelCase							,			__lowerCamelCase							,			__lowerCamelCase    )      ->       int:

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

	a										=							[-1] * (target + 1)
	return count_of_possible_combinations_with_dp_array(UpperCamelCase_							,			UpperCamelCase_    )





def 		__A		(	__lowerCamelCase							,			__lowerCamelCase							,			__lowerCamelCase    )      ->       Optional[int]:
	a										=							[0] * (target + 1)
	a										=							1

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

	return dp_array[target]


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		__UpperCamelCase					:       Tuple    					=      3
		__UpperCamelCase					:       Optional[Any]    					=      5
		__UpperCamelCase					:       Optional[int]    					=      [1, 2, 5]
		print(combination_sum_iv(n, array, target))



"""simple docstring"""





from math import isqrt, loga



def 						_lowerCAmelCase				(				UpperCamelCase_				):
		__SCREAMING_SNAKE_CASE            = [True] * max_number
		for i in range(2  ,				isqrt(max_number - 1				) + 1				):
				if is_prime[i]:
						for j in range(i**2  ,				UpperCamelCase_  ,				UpperCamelCase_				):
								__SCREAMING_SNAKE_CASE            = False

		return [i for i in range(2  ,				UpperCamelCase_				) if is_prime[i]]



def 						_lowerCAmelCase				(				UpperCamelCase_ = 80_0800  ,				UpperCamelCase_ = 80_0800				):
		__SCREAMING_SNAKE_CASE            = degree * loga(UpperCamelCase_				)
		__SCREAMING_SNAKE_CASE            = int(UpperCamelCase_				)
		__SCREAMING_SNAKE_CASE            = calculate_prime_numbers(UpperCamelCase_				)

		__SCREAMING_SNAKE_CASE            = 0
		__SCREAMING_SNAKE_CASE            = 0
		__SCREAMING_SNAKE_CASE            = len(UpperCamelCase_				) - 1
		while left < right:
				while (
				    prime_numbers[right] * loga(prime_numbers[left]				)
				    + prime_numbers[left] * loga(prime_numbers[right]				)
				    > upper_bound
				):
						right -= 1
				hybrid_integers_count += right - left
				left += 1

		return hybrid_integers_count


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




