code: 
  
  
  from functools import lru_cache
  
  
  
  @lru_cache
  def        SCREAMING_SNAKE_CASE__(		_UpperCamelCase      :				int   )		->					int:
  
  
  
  
  
     '''simple docstring'''
  
  
  
  
  
  
  
     if not isinstance(_UpperCamelCase    ,		_UpperCamelCase   ):
        raise TypeError("k must be an integer."   )
     if k < 0:
        raise ValueError("k integer must be greater or equal to zero."   )
     if k == 0:
        return 0
     elif k == 1:
        return 1
     else:
        return fibonacci(k - 1   ) + fibonacci(k - 2   )
  
  
  
  def        SCREAMING_SNAKE_CASE__(		_UpperCamelCase      :				list    ,		_UpperCamelCase      :				int   )		->					int:
  
  
  
  
  
     '''simple docstring'''
  
  
  
  
  
  
  
     UpperCamelCase__ 						=						len(_UpperCamelCase   )
     # Find m such that F_m >= n where F_i is the i_th fibonacci number.
     UpperCamelCase__ 						=						0
     while True:
        if fibonacci(_UpperCamelCase   ) >= len_list:
           UpperCamelCase__ 						=						i
           break
        i += 1
     UpperCamelCase__ 						=						0
     while fibb_k > 0:
        UpperCamelCase__ 						=						min(
            offset + fibonacci(fibb_k - 1   )    ,		len_list - 1   )  # Prevent out of range
        UpperCamelCase__ 						=						arr[index_k]
        if item_k_1 == val:
           return index_k
        elif val < item_k_1:
           fibb_k -= 1
        elif val > item_k_1:
           offset += fibonacci(fibb_k - 1   )
           fibb_k -= 2
     else:
        return -1
  
  
  if __name__ == "__main__":
         import doctest
  
         doctest.testmod()
style_context: 
  
  
  '''simple docstring'''
  
  def        SCREAMING_SNAKE_CASE__(		_UpperCamelCase      :				int = 10_00   )		->					int:
  
  
  
  
  
     '''simple docstring'''
  
  
  
  
  
  
  
     return sum(i for i in range(_UpperCamelCase   ) if i % 3 == 0 or i % 5 == 0   )
  
  
  if __name__ == "__main__":
         print(F"""{solution() = }""")