#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define __Dennis_Tran___ signed main()
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define file(name)  if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

using namespace std;

const int maxN = 1e5 + 5;

int n, m, Num[maxN], Low[maxN], cnt = 0;
vector <int> ke[maxN];
vector <pair <int, int>> ans;

void dfs(int u, int par = -1) {
    Num[u] = Low[u] = ++cnt;
    for (int v : ke[u]) if (v != par) {
        if (Num[v]) Low[u] = min(Low[u], Num[v]);
        else {
            dfs(v, u);
            Low[u] = min(Low[u], Low[v]);

            if (Low[v] == Num[v]) {
                ans.emplace_back(min(u, v), max(u, v));
            }
        }
    }
}

__Dennis_Tran___{
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr);

    cin >> n >> m;
    while (m--) {
        int u, v; cin >> u >> v;
        ke[u].emplace_back(v);
        ke[v].emplace_back(u);
    }

    FOR(i, 1, n) if (Num[i] == 0) {
        dfs(i);
    }

    sort(ALL(ans));
    cout << ans.size() << '\n';
    for (auto [u, v] : ans) cout << u << ' ' << v << '\n';
    cerr << "Time elapsed: " << TIME << " s.\n";
    return (0 ^ 0);
}