


def     __lowerCamelCase						(			UpperCAmelCase_						:		int			,  UpperCAmelCase_						:		list[int]			,  UpperCAmelCase_						:		int						):




						"""simple docstring"""





						def count_of_possible_combinations(UpperCAmelCase_						:		int						) -> 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     __lowerCamelCase						(			UpperCAmelCase_						:		int			,  UpperCAmelCase_						:		list[int]			,  UpperCAmelCase_						:		int						):




						"""simple docstring"""





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

						a						:int										=	[-1] * (target + 1)
						return count_of_possible_combinations_with_dp_array(UpperCAmelCase_			,  UpperCAmelCase_						)
def     __lowerCamelCase						(			UpperCAmelCase_						:		int			,  UpperCAmelCase_						:		list[int]			,  UpperCAmelCase_						:		int						):




						"""simple docstring"""





						a						:List[str]										=	[0] * (target + 1)
						a						:Any										=	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()
					snake_case    :   Optional[int]	    =					3
					snake_case    :   List[Any]	    =					5
					snake_case    :   Any	    =					[1, 2, 5]
					print(combination_sum_iv(n, array, target))









def     __lowerCamelCase						(			UpperCAmelCase_						:		int = 100						):




      """simple docstring"""





      a						:List[Any]										=	0
      a						:List[Any]										=	0
      for i in range(1			,  n + 1						):
            sum_of_squares += i**2
            sum_of_ints += i
      return sum_of_ints**2 - sum_of_squares


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





