




def       lowerCAmelCase_      (	lowerCamelCase:							int  ,					lowerCamelCase:							int = 10_00    )       ->      List[str]:


      '''simple docstring'''




      if (not isinstance(__lowercase  ,					__lowercase    )) or (digit_position <= 0):
            raise ValueError('Digit position must be a positive integer'    )
      elif (not isinstance(__lowercase  ,					__lowercase    )) or (precision < 0):
            raise ValueError('Precision must be a nonnegative integer'    )

      # compute an approximation of (16 ** (n - 1)) * pi whose fractional part is mostly
      # accurate
      lowerCamelCase__   	=					(
          4 * _subsum(__lowercase  ,					1  ,					__lowercase    )
          - 2 * _subsum(__lowercase  ,					4  ,					__lowercase    )
          - _subsum(__lowercase  ,					5  ,					__lowercase    )
          - _subsum(__lowercase  ,					6  ,					__lowercase    )
      )

      # return the first hex digit of the fractional part of the result
      return hex(int((sum_result % 1) * 16    )    )[2:]

def       lowerCAmelCase_      (	lowerCamelCase:							int  ,					lowerCamelCase:							int  ,					lowerCamelCase:							int    )       ->      Union[str, Any]:


      '''simple docstring'''




      lowerCamelCase__   	=					0.0
      for sum_index in range(digit_pos_to_extract + precision    ):
            lowerCamelCase__   	=					8 * sum_index + denominator_addend
            if sum_index < digit_pos_to_extract:
                  # if the exponential term is an integer and we mod it by the denominator
                  # before dividing, only the integer part of the sum will change;
                  # the fractional part will not
                  lowerCamelCase__   	=					pow(
                      16  ,					digit_pos_to_extract - 1 - sum_index  ,					__lowercase    )
            else:
                  lowerCamelCase__   	=					pow(16  ,					digit_pos_to_extract - 1 - sum_index    )
            total += exponential_term / denominator
      return total


if __name__ == "__main__":
      import doctest

      doctest.testmod()






def        __SCREAMING_SNAKE_CASE	(				__lowercase:		int = 10_00):



  '''simple docstring'''






  __lowerCAmelCase								=					0
  for i in range(__lowercase):
    if i % 3 == 0 or i % 5 == 0:
      result += i
  return result


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