code: 
  
  
  
  
  
  def     a						(      _lowercase   :     list ,						_lowercase   :     int ,						_lowercase   :     int ,						_lowercase   :     int       )     ->int:
  		UpperCamelCase__         =	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(_lowercase ,						r + 1 ,						_lowercase ,						_lowercase       )
  		else:
  				return binary_search(_lowercase ,						_lowercase ,						r - 1 ,						_lowercase       )
  
  def     a						(      _lowercase   :     int ,						_lowercase   :     list       )     ->list:
  		UpperCamelCase__         =	0
  		if matrix[index][0] == value:
  				return [index, 0]
  		while index < len(_lowercase       ) and matrix[index][0] < value:
  				UpperCamelCase__         =	binary_search(matrix[index] ,						0 ,						len(matrix[index]       ) - 1 ,						_lowercase       )
  				if r != -1:
  						return [index, r]
  				index += 1
  		return [-1, -1]
  
  
  if __name__ == "__main__":
  				import doctest
  
  				doctest.testmod()
  
  
  
  
  
  
style_context: 
  
  
  
  
  
  def     a						(      _lowercase   :     List[str]       )     ->List[str]:
  		UpperCamelCase__         =	[7_0_1, 3_0_1, 1_3_2, 5_7, 2_3, 1_0, 4, 1]
  		for gap in gaps:
  				for i in range(_lowercase ,						len(_lowercase       )       ):
  						UpperCamelCase__         =	collection[i]
  						UpperCamelCase__         =	i
  						while j >= gap and collection[j - gap] > insert_value:
  								UpperCamelCase__         =	collection[j - gap]
  								j -= gap
  						if j != i:
  								UpperCamelCase__         =	insert_value
  		return collection
  
  
  if __name__ == "__main__":
  				from doctest import testmod
  
  				testmod()
  				__lowerCAmelCase     =			input("Enter numbers separated by a comma:\n").strip()
  				__lowerCAmelCase     =			[int(item) for item in user_input.split(",")]
  				print(shell_sort(unsorted))
  
  
  
  
  
  