




'''simple docstring'''


def 					SCREAMING_SNAKE_CASE(   __lowercase = 9_9_8_0_0_1	)			-> List[str]:

     # fetches the next number
     for number in range(n - 1		,				9_9_9_9		,				-1	):
          A:		Any          =		str(__UpperCamelCase	)

          # checks whether 'str_number' is a palindrome.
          if str_number == str_number[::-1]:
               A:		Union[str, Any]          =		9_9_9

               # if 'number' is a product of two 3-digit numbers
               # then number is the answer otherwise fetch next number.
               while divisor != 9_9:
                    if (number % divisor == 0) and (len(str(number // divisor	)	) == 3.0):
                         return number
                    divisor -= 1
     raise ValueError('''That number is larger than our acceptable range.'''	)


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










__lowerCamelCase   	=  {0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}

__lowerCamelCase   	=  {0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}



def 			_a      (    __UpperCamelCase	,	__UpperCamelCase	,	__UpperCamelCase			):
     a_     :  Tuple				      =     True
     a_     :  Optional[Any]				      =     []

     for neighbour in graph[vert]:
          if not visited[neighbour]:
               connected_verts += dfs(__UpperCamelCase	,	__UpperCamelCase	,	__UpperCamelCase			)

     return [vert, *connected_verts]



def 			_a      (    __UpperCamelCase			):
     a_     :  Dict				      =     len(__UpperCamelCase			)
     a_     :  List[str]				      =     graph_size * [False]
     a_     :  Dict				      =     []

     for i in range(__UpperCamelCase			):
          if not visited[i]:
               a_     :  str				      =     dfs(__UpperCamelCase	,	__UpperCamelCase	,	__UpperCamelCase			)
               components_list.append(__UpperCamelCase			)

     return components_list


if __name__ == "__main__":
       import doctest

       doctest.testmod()



