



'''simple docstring'''






def     snake_case_					(     lowerCAmelCase_		)->		str:  # noqa: E741





       '''simple docstring'''


       _UpperCAmelCase  :						str			     = len(__lowerCamelCase		)
       _UpperCAmelCase  :						int			     = 0
       _UpperCAmelCase  :						Any			     = [0] * n
       _UpperCAmelCase  :						List[str]			     = [False] * n
       _UpperCAmelCase  :						Optional[Any]			     = [False] * n

       def dfs(lowerCAmelCase_       ,   lowerCAmelCase_       ,   lowerCAmelCase_       ,   lowerCAmelCase_		):
              if parent == root:
                     out_edge_count += 1
              _UpperCAmelCase  :						List[str]			     = True
              _UpperCAmelCase  :						Any			     = at

              for to in l[at]:
                     if to == parent:
                            pass
                     elif not visited[to]:
                            _UpperCAmelCase  :						Union[str, Any]			     = dfs(__lowerCamelCase       ,   __lowerCamelCase       ,   __lowerCamelCase       ,   __lowerCamelCase		)
                            _UpperCAmelCase  :						List[str]			     = min(low[at]       ,   low[to]		)

                            # AP found via bridge
                            if at < low[to]:
                                   _UpperCAmelCase  :						Dict			     = True
                            # AP found via cycle
                            if at == low[to]:
                                   _UpperCAmelCase  :						Any			     = True
                     else:
                            _UpperCAmelCase  :						int			     = min(low[at]       ,   __lowerCamelCase		)
              return out_edge_count

       for i in range(__lowerCamelCase		):
              if not visited[i]:
                     _UpperCAmelCase  :						int			     = 0
                     _UpperCAmelCase  :						Tuple			     = dfs(__lowerCamelCase       ,   __lowerCamelCase       ,   -1       ,   __lowerCamelCase		)
                     _UpperCAmelCase  :						Any			     = out_edge_count > 1

       for x in range(len(__lowerCamelCase		)		):
              if is_art[x] is True:
                     print(__lowerCamelCase		)


# Adjacency list of graph
A_							: List[str]						 =	{
    0: [1, 2],
    1: [0, 2],
    2: [0, 1, 3, 5],
    3: [2, 4],
    4: [3],
    5: [2, 6, 8],
    6: [5, 7],
    7: [6, 8],
    8: [5, 7],
}
compute_ap(data)









def 		__A		(	__lowerCamelCase							,			__lowerCamelCase    )      ->       str:
	if not isinstance(__lowerCamelCase							,			__lowerCamelCase    ):
		raise ValueError("""iterations must be defined as integers"""    )
	if not isinstance(__lowerCamelCase							,			__lowerCamelCase    ) or not number >= 1:
		raise ValueError(
		    """starting number must be
                         and integer and be more than 0"""    )
	if not iterations >= 1:
		raise ValueError("""Iterations must be done more than 0 times to play FizzBuzz"""    )

	a										=							""""""
	while number <= iterations:
		if number % 3 == 0:
			out += "Fizz"
		if number % 5 == 0:
			out += "Buzz"
		if 0 not in (number % 3, number % 5):
			out += str(__lowerCamelCase    )

		# print(out)
		number += 1
		out += " "
	return out


if __name__ == "__main__":
		import doctest

		doctest.testmod()

