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

int n, m;
vector<vector<int>> ikeru;
vector<int> piv;
vector<bool> del;
vector<bool> tansaku;
int u[350000], v[350000];

int dfs(int i){
	tansaku[i] = true;
	while(piv[i] < (int)ikeru[i].size()){
		int j = ikeru[i][piv[i]];
		if (tansaku[v[j]]){
			del[j] = true;
			piv[i]++;
			tansaku[i] = false;
			return v[j];
		}
		int g = dfs(v[j]);
		if (g != -1 && g != i){
			del[j] = true;
			piv[i]++;
			tansaku[i] = false;
			return g;
		}else if (g == i){
			del[j] = true;
		}
		piv[i]++;
	}
	tansaku[i] = false;
	return -1;
}

int main(){
	cin >> n >> m;
	ikeru.resize(n);
	piv.resize(n);
	del.resize(m);
	tansaku.resize(n);
	for (int i=0; i<m; i++){
		cin >> u[i] >> v[i];
		u[i]--;
		v[i]--;
		ikeru[u[i]].push_back(i);
	}
	for (int i=0; i<n; i++){
		dfs(i);
	}
	vector<pair<int,int>> ans;
	for (int i=0; i<m; i++){
		if (!del[i]){
			ans.push_back(pair(u[i]+1, v[i]+1));
		}
	}
	cout << n << ' ' << (int)ans.size() << '\n';
	for (int i=0; i<(int)ans.size(); i++){
		cout << ans[i].first << ' ' << ans[i].second << '\n';
	}
}