#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/scc>
#include<set>
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<int> u(m),v(m);
    atcoder::scc_graph g(n);
    for(int i = 0;i<m;i++){
        cin>>u[i]>>v[i];
        u[i]--;v[i]--;
        g.add_edge(u[i],v[i]);
    }
    auto use = g.scc();
    vector<pair<int,int>> ans;
    vector<int> cnt(n,0);
    for(int i = 0;i<use.size();i++){
        for(auto&j:use[i]) cnt[j] = i;
    }
    vector<vector<int>> c(n);
    vector<int> vis(n,0);

    //vector<pair<int,int>> ans;
    for(int i = 0;i<use.size();i++){
        int m = use[i].size();
        if(m==1) continue;
        for(int j = 0;j<m;j++){
            int nj = (j+1) % m;
            ans.push_back(make_pair(use[i][j],use[i][nj]));
        }
    }
    for(int i = 0;i+1<use.size();i++) ans.push_back(make_pair(use[i][0],use[i+1][0]));
    cout<<ans.size()<<endl;
    for(int i = 0;i<ans.size();i++) cout<<ans[i].first+1<<" "<<ans[i].second+1<<endl;
}