#include<iostream>
#include<algorithm>
#include<vector>
#include<cassert>
using namespace std;
int N,M;
int U[3<<17],V[3<<17];
bool del[3<<17];
vector<int>G[3<<17];
int Gi[3<<17];
bool vis[3<<17];
vector<int>path;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N>>M;
	for(int i=0;i<M;i++)
	{
		cin>>U[i]>>V[i];
		U[i]--,V[i]--;
		G[U[i]].push_back(i);
	}
	for(int i=0;i<N;i++)
	{
		path.push_back(i);
		vis[i]=true;
		while(!path.empty())
		{
			int u=path.back();
			if(Gi[u]==G[u].size())
			{
				vis[u]=false;
				path.pop_back();
				continue;
			}
			int ei=G[u][Gi[u]++];
			int v=V[ei];
			path.push_back(v);
			if(!vis[v])
			{
				vis[v]=true;
				continue;
			}
			do{
				path.pop_back();
				int w=path.back();
				vis[w]=false;
				del[G[w][Gi[w]-1]]=true;
			}while(path.back()!=v);
			vis[v]=true;
		}
	}
	vector<pair<int,int> >ans;
	for(int i=0;i<M;i++)if(!del[i])ans.push_back(make_pair(U[i],V[i]));
	cout<<N<<" "<<ans.size()<<"\n";
	for(pair<int,int>e:ans)cout<<e.first+1<<" "<<e.second+1<<"\n";
}