





'''simple docstring'''


def 						__a(SCREAMING_SNAKE_CASE_	:       int = 1		,							SCREAMING_SNAKE_CASE_	:       int = 1000     ):



    '''simple docstring'''





    _lowerCAmelCase						      =   1
    _lowerCAmelCase						      =   0

    for divide_by_number in range(SCREAMING_SNAKE_CASE_		,							digit + 1     ):
        _lowerCAmelCase						      =   []
        _lowerCAmelCase						      =   numerator
        for _ in range(1		,							digit + 1     ):
            if now_divide in has_been_divided:
                if longest_list_length < len(SCREAMING_SNAKE_CASE_     ):
                    _lowerCAmelCase						      =   len(SCREAMING_SNAKE_CASE_     )
                    _lowerCAmelCase						      =   divide_by_number
            else:
                has_been_divided.append(SCREAMING_SNAKE_CASE_     )
                _lowerCAmelCase						      =   now_divide * 10 % divide_by_number

    return the_digit


# Tests
if __name__ == "__main__":
       import doctest

       doctest.testmod()







"""simple docstring"""

def  __snake_case							(	__A      :						list							,		__A      :						int							,		__A      :						int = 0							,		__A      :						int = 0     )     ->       int:






				'''simple docstring'''
				SCREAMING_SNAKE_CASE						:							Any							=     right or len(__A     ) - 1
				if left > right:
								return -1
				elif list_data[left] == key:
								return left
				elif list_data[right] == key:
								return right
				else:
								return search(__A							,		__A							,		left + 1							,		right - 1     )


if __name__ == "__main__":
							import doctest

							doctest.testmod()





