





def A_     (		A__    )  ->		list:
       return [
           txt[:a] + txt[a].upper() + txt[a + 1 :]
           for a in range(len(A__    )    )
           if txt[a].isalpha()
       ]


if __name__ == "__main__":
    __import__("""doctest""").testmod()









def A_     (		A__    )  ->		List[str]:  # noqa: E741
       a__						:     Dict			=    len(A__    )
       a__						:     str			=    0
       a__						:     Any			=    [0] * n
       a__						:     int			=    [False] * n
       a__						:     Optional[Any]			=    [False] * n

       def dfs(A__		,				A__		,				A__		,				A__    ):
              if parent == root:
                     out_edge_count += 1
              a__						:     Union[str, Any]			=    True
              a__						:     Optional[Any]			=    at

              for to in l[at]:
                     if to == parent:
                            pass
                     elif not visited[to]:
                            a__						:     List[Any]			=    dfs(A__		,				A__		,				A__		,				A__    )
                            a__						:     Dict			=    min(low[at]		,				low[to]    )

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

       for i in range(A__    ):
              if not visited[i]:
                     a__						:     Tuple			=    0
                     a__						:     Any			=    dfs(A__		,				A__		,				-1		,				A__    )
                     a__						:     List[Any]			=    out_edge_count > 1

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


# Adjacency list of graph
lowercase				:	List[Any]      						=  {
    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)


