


def 	_lowerCamelCase  (		A_  :	int							,  A_  :	int      )			->			int:

   '''simple docstring'''






   UpperCamelCase__ :			str 						=1.0
   for i in range(1							,  r + 1      ):
      ret *= (n + 1 - i) / i
   return round(A_      )
def 	_lowerCamelCase  (		A_  :	int      )			->			int:

   '''simple docstring'''






   return choose(8 + n							,  A_      ) + choose(9 + n							,  A_      ) - 1_0
def 	_lowerCamelCase  (		A_  :	int      )			->			int:

   '''simple docstring'''






   return sum(non_bouncy_exact(A_      ) for i in range(1							,  n + 1      )      )
def 	_lowerCamelCase  (		A_  :	int = 1_0_0      )			->			int:

   '''simple docstring'''






   return non_bouncy_upto(A_      )


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





def 	_lowerCamelCase  (		A_  :	float							,  A_  :	float							,  A_  :	int      )			->			float:

   '''simple docstring'''






   UpperCamelCase__ :			Union[str, Any] 						=[1 / first_term]
   UpperCamelCase__ :			Tuple 						=1 / first_term
   for _ in range(number_of_terms - 1      ):
      first_term += common_difference
      arithmetic_progression.append(A_      )
   UpperCamelCase__ :			List[str] 						=[1 / step for step in arithmetic_progression]
   return sum(A_      )


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     print(sum_of_harmonic_progression(1 / 2, 2, 2))

