Articulation Points

The undirected graph has n nodes and edges, and it is connected. A node is an articulation point (cut vertex) if removing it, together with its edges, leaves the remaining nodes disconnected. Return the articulation points in increasing order.

For n = 5 and edges = [[0, 1], [1, 2], [2, 0], [1, 3], [3, 4]] the answer is [1, 3].

Examples

Example 1

Input:

articulation_points(5, [[0, 1], [1, 2], [2, 0], [1, 3], [3, 4]])

Output:

[1, 3]

Example 2

Input:

articulation_points(3, [[0, 1], [1, 2], [2, 0]])

Output:

[]

Constraints

• 1 <= n <= 100000
• n - 1 <= len(edges) <= 200000
• No repeated edges, no self-loops.