#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
ifstream in_file("minta/be2.txt");
#define input in_file
#define INTHENAMEOFGOD
#else
#define input cin
#define INTHENAMEOFGOD \
    ios::sync_with_stdio(0); \
    cin.tie(0); \
    cout.tie(0);
#endif
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<ll, ll> pii;

ll N, M, a, b, max_korszam;
vvi G;
vi becsat, korszam, el_fok;
vector<pii> kor;
vector<char> vis;

bool dfs1(ll x) {
    vis[x] = 1;
    for (ll next : G[x]) {
        if (!vis[next] && dfs1(next)) {
            kor[x] = {next, el_fok.size()};
            el_fok.push_back(0);
            return true;
        }
        if (vis[next] == 1) {
            kor[x] = {next, el_fok.size()};
            el_fok.push_back(0);
            return true;
        }
    }
    vis[x] = 2;
    return false;
}

void korbejar(ll tol, ll ig) {
    ll most = tol;
    while (most != ig) {
        el_fok[kor[most].second]++;
        most = kor[most].first;
    }
}

void dfs2(ll x, ll kezdx) {
    vis[x] = 1;
    for (ll next : G[x]) {
        if (kor[next].first != -1) {
            korbejar(next, kezdx);
            continue;
        }
        if (!vis[next]) {
            dfs2(next, kezdx);
        }
    }
}

int main() {
    INTHENAMEOFGOD
    input >> N >> M;
    G.resize(N);
    for (ll m = 0; m < M; m++) {
        input >> a >> b;
        a--; b--;
        G[a].push_back(b);
    }

    vis.assign(N, 0);
    becsat.assign(N, 0);
    korszam.assign(N, 0);
    kor.assign(N, {-1, 0});
    dfs1(0);
    vis.assign(N, 0);
    for (ll n = 0; n < N; n++) {
        if (kor[n].first != -1) {
            for (ll next : G[n]) {
                if (next != kor[n].first) {
                    dfs2(next, n);
                }
            }
        }
    }

    ll maxfok = *max_element(el_fok.begin(), el_fok.end());

    ll db = 0;
    string s;
    ostringstream os(s);

    for (ll n = 0; n < N; n++) {
        if (kor[n].first != -1 && el_fok[kor[n].second] == maxfok) {
            db++;
            os << kor[n].first+1 << " " << kor[kor[n].first].first+1 << "\n";
        }
    }

    cout << db << "\n" << os.str();
}