
'''simple docstring'''

def        SCREAMING_SNAKE_CASE_  (	snake_case_				:	str							)       ->	List[str]:
 SCREAMING_SNAKE_CASE  :  Dict								=		1
 SCREAMING_SNAKE_CASE  :  Dict								=		0
 SCREAMING_SNAKE_CASE  :  str								=		1
 SCREAMING_SNAKE_CASE  :  Any								=		1
 SCREAMING_SNAKE_CASE  :  Optional[Any]								=		3
 SCREAMING_SNAKE_CASE  :  List[Any]								=		3
 SCREAMING_SNAKE_CASE  :  List[Any]								=		limit
 SCREAMING_SNAKE_CASE  :  int								=		0

 SCREAMING_SNAKE_CASE  :  int								=		""""""
 while counter != decimal + 1:
  if 4 * q + r - t < n * t:
   result += str(__UpperCamelCase							)
   if counter == 0:
    result += "."

   if decimal == counter:
    break

   counter += 1
   SCREAMING_SNAKE_CASE  :  Dict								=		10 * (r - n * t)
   SCREAMING_SNAKE_CASE  :  Any								=		((10 * (3 * q + r)) // t) - 10 * n
   q *= 10
   SCREAMING_SNAKE_CASE  :  int								=		nr
  else:
   SCREAMING_SNAKE_CASE  :  List[Any]								=		(2 * q + r) * l
   SCREAMING_SNAKE_CASE  :  Optional[Any]								=		(q * (7 * k) + 2 + (r * l)) // (t * l)
   q *= k
   t *= l
   l += 2
   k += 1
   SCREAMING_SNAKE_CASE  :  Tuple								=		nn
   SCREAMING_SNAKE_CASE  :  Dict								=		nr
 return result



def        SCREAMING_SNAKE_CASE_  (	)       ->	Optional[int]:
 print(f"""{calculate_pi(50							) = }"""							)
 import doctest

 doctest.testmod()


if __name__ == "__main__":
   main()






__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()



