

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

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







def 						_snake_case		(     SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE					)							->   int:

     """simple docstring"""







     _lowerCAmelCase :       Tuple	   =     True
     _lowerCAmelCase :       int	   =     []

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

     return [vert, *connected_verts]







def 						_snake_case		(     SCREAMING_SNAKE_CASE					)							->   Tuple:

     """simple docstring"""







     _lowerCAmelCase :       Any	   =     len(_lowerCamelCase					)
     _lowerCAmelCase :       int	   =     graph_size * [False]
     _lowerCAmelCase :       Dict	   =     []

     for i in range(_lowerCamelCase					):
          if not visited[i]:
               _lowerCAmelCase :       List[Any]	   =     dfs(_lowerCamelCase		,				_lowerCamelCase		,				_lowerCamelCase					)
               components_list.append(_lowerCamelCase					)

     return components_list


if __name__ == "__main__":
  import doctest

  doctest.testmod()













from itertools import combinations_with_replacement







def    UpperCAmelCase				(  _lowerCamelCase   :	int = 100  ):





						'''simple docstring'''


						SCREAMING_SNAKE_CASE__  :					list[int] =       [*list(range(1      , 21  )  ), 25]
						SCREAMING_SNAKE_CASE__  :					list[int] =       [2 * x for x in range(1      , 21  )] + [50]
						SCREAMING_SNAKE_CASE__  :					list[int] =       [3 * x for x in range(1      , 21  )]
						SCREAMING_SNAKE_CASE__  :					list[int] =       singles + doubles + triples + [0]

						SCREAMING_SNAKE_CASE__  :					int =       0
						SCREAMING_SNAKE_CASE__  :					int
						SCREAMING_SNAKE_CASE__  :					int
						SCREAMING_SNAKE_CASE__  :					int
						SCREAMING_SNAKE_CASE__  :					int

						for double in doubles:
												for throwa, throwa in combinations_with_replacement(_lowerCamelCase      , 2  ):
																		SCREAMING_SNAKE_CASE__  :					int =       double + throwa + throwa
																		if checkout_total < limit:
																								num_checkouts += 1

						return num_checkouts


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