"""simple docstring"""
from hashlib import mda, shaaaa

lowercase__   			=      (shaaaa, mda)




class   __snake_case			:



      def __init__(		self       ,     lowercase = 8)      ->     None:





        '''simple docstring'''





        a__:	Optional[Any]     				=      0b0
        a__:	Dict     				=      size



      def     lowerCamelCase_  (		self       ,     lowercase)      ->     None:





        '''simple docstring'''





        a__:	Union[str, Any]     				=      self.hash_(lowercase)
        self.bitarray |= h



      def     lowerCamelCase_  (		self       ,     lowercase)      ->     bool:





        '''simple docstring'''





        a__:	Tuple     				=      self.hash_(lowercase)
        return (h & self.bitarray) == h



      def __contains__(		self       ,     lowercase)      ->     bool:





        '''simple docstring'''





        return self.exists(lowercase)



      def     lowerCamelCase_  (		self       ,     lowercase)      ->     str:





        '''simple docstring'''





        a__:	Optional[int]     				=      bin(lowercase)[2:]
        return res.zfill(self.size)



      @property
      def     lowerCamelCase_  (		self)      ->     str:





        '''simple docstring'''





        return self.format_bin(self.bitarray)



      def     lowerCamelCase_  (		self       ,     lowercase)      ->     int:





        '''simple docstring'''





        a__:	Tuple     				=      0b0
        for func in HASH_FUNCTIONS:
          a__:	Dict     				=      (
              int.from_bytes(func(value.encode()).digest()       ,     'little') % self.size
          )
          res |= 2**position
        return res



      def     lowerCamelCase_  (		self       ,     lowercase)      ->     str:





        '''simple docstring'''





        return self.format_bin(self.hash_(lowercase))



      @property
      def     lowerCamelCase_  (		self)      ->     float:





        '''simple docstring'''





        a__:	str     				=      bin(self.bitarray).count('1')
        return (n_ones / self.size) ** len(lowercase)







'''simple docstring'''







def 			_lowerCAmelCase(      UpperCAmelCase_      :	list					, UpperCAmelCase_      :	int					, UpperCAmelCase_      :	int					, UpperCAmelCase_      :	int						) ->							int:
							lowerCAmelCase__  =   int((lower_bound + upper_bound) // 2						)
							if array[r] == value:
														return r
							if lower_bound >= upper_bound:
														return -1
							if array[r] < value:
														return binary_search(UpperCAmelCase_					, r + 1					, UpperCAmelCase_					, UpperCAmelCase_						)
							else:
														return binary_search(UpperCAmelCase_					, UpperCAmelCase_					, r - 1					, UpperCAmelCase_						)
def 			_lowerCAmelCase(      UpperCAmelCase_      :	int					, UpperCAmelCase_      :	list						) ->							list:
							lowerCAmelCase__  =   0
							if matrix[index][0] == value:
														return [index, 0]
							while index < len(UpperCAmelCase_						) and matrix[index][0] < value:
														lowerCAmelCase__  =   binary_search(matrix[index]					, 0					, len(matrix[index]						) - 1					, UpperCAmelCase_						)
														if r != -1:
																					return [index, r]
														index += 1
							return [-1, -1]


if __name__ == "__main__":
		import doctest

		doctest.testmod()





