#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
#include <set>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const int MOD = 1e9 + 7;

using Gragh = vector<vector<int>>;
struct LowLink
{
    int V;
    Gragh G;
    vector<int> used, order, lowlink, articulation;
    vector<pair<int, int>> bridges;
    LowLink(int V) : V(V)
    {
        G.resize(V);
        used.resize(V, 0);
        order.resize(V, 0);
        lowlink.resize(V, 0);
    }
    void add_edge(int s, int t) { G[s].emplace_back(t); }
    void dfs(int v, int p)
    {
        static int k = 0;
        used[v] = 1;
        order[v] = lowlink[v] = k++;
        int cnt = 0;
        bool flag = false;
        for(auto &u : G[v])
        {
            if(not used[u])
            {
                cnt++;
                dfs(u, v);
                lowlink[v] = min(lowlink[v], lowlink[u]);
                if(order[v] <= lowlink[u] and p != -1) flag = true;
                if(order[v] < lowlink[u]) bridges.emplace_back(min(v, u), max(v, u));
            }
            else if(u != p) lowlink[v] = min(lowlink[v], order[u]);
        }
        if(p == -1 and cnt > 1) flag = true;
        if(flag) articulation.push_back(v);
    }
    void build() { dfs(0, -1); }
};

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int V, E; cin >> V >> E;
    LowLink L(V);
    for(int i = 0; i < E; i++)
    {
        int s, t; cin >> s >> t;
        L.add_edge(s, t);
        L.add_edge(t, s);
    }
    L.build();
    sort(L.bridges.begin(), L.bridges.end());
    for(auto ans : L.bridges) cout << ans.first << " " << ans.second << endl;
    return 0;
}

### Prompt

Your challenge is to write a cpp solution to the following problem:

Find bridges of an undirected graph G(V, E).

A bridge (also known as a cut-edge) is an edge whose deletion increase the number of connected components.

Constraints

* 1 ≤ |V| ≤ 100,000
* 0 ≤ |E| ≤ 100,000
* The graph is connected
* There are no parallel edges
* There are no self-loops

Input


|V| |E|
s0 t0
s1 t1
:
s|E|-1 t|E|-1


, where |V| is the number of nodes and |E| is the number of edges in the graph. The graph nodes are named with the numbers 0, 1,..., |V|-1 respectively.

si and ti represent source and target nodes of i-th edge (undirected).

Output

A list of bridges of the graph ordered by name. For each bridge, names of its end-ponints, source and target (source < target), should be printed separated by a space. The sources should be printed ascending order, then the target should also be printed ascending order for the same source.

Examples

Input

4 4
0 1
0 2
1 2
2 3


Output

2 3


Input

5 4
0 1
1 2
2 3
3 4


Output

0 1
1 2
2 3
3 4

### Response

```cpp
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
#include <set>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const int MOD = 1e9 + 7;

using Gragh = vector<vector<int>>;
struct LowLink
{
    int V;
    Gragh G;
    vector<int> used, order, lowlink, articulation;
    vector<pair<int, int>> bridges;
    LowLink(int V) : V(V)
    {
        G.resize(V);
        used.resize(V, 0);
        order.resize(V, 0);
        lowlink.resize(V, 0);
    }
    void add_edge(int s, int t) { G[s].emplace_back(t); }
    void dfs(int v, int p)
    {
        static int k = 0;
        used[v] = 1;
        order[v] = lowlink[v] = k++;
        int cnt = 0;
        bool flag = false;
        for(auto &u : G[v])
        {
            if(not used[u])
            {
                cnt++;
                dfs(u, v);
                lowlink[v] = min(lowlink[v], lowlink[u]);
                if(order[v] <= lowlink[u] and p != -1) flag = true;
                if(order[v] < lowlink[u]) bridges.emplace_back(min(v, u), max(v, u));
            }
            else if(u != p) lowlink[v] = min(lowlink[v], order[u]);
        }
        if(p == -1 and cnt > 1) flag = true;
        if(flag) articulation.push_back(v);
    }
    void build() { dfs(0, -1); }
};

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int V, E; cin >> V >> E;
    LowLink L(V);
    for(int i = 0; i < E; i++)
    {
        int s, t; cin >> s >> t;
        L.add_edge(s, t);
        L.add_edge(t, s);
    }
    L.build();
    sort(L.bridges.begin(), L.bridges.end());
    for(auto ans : L.bridges) cout << ans.first << " " << ans.second << endl;
    return 0;
}

```