#include<iostream>
#include<algorithm>
#include<vector>
#include<cassert>
using namespace std;
int N,M;
int U[6<<17],V[6<<17];
int deg[3<<17];
bool del[3<<17];
vector<int>G[3<<17];
int Gi[3<<17];
int Esi[3<<17];
void solve()
{
	for(int i=0;i<N;i++)
	{
		deg[i]=0;
		G[i].clear();
		Gi[i]=0;
		Esi[i]=-1;
	}
	for(int i=0;i<M;i++)if(!del[i])
	{
		deg[U[i]]++;
		deg[V[i]]--;
		G[U[i]].push_back(i);
	}
	vector<int>from,to;
	for(int i=0;i<N;i++)
	{
		if(deg[i]>=0)
		{
			for(int j=0;j<deg[i];j++)to.push_back(i);
		}
		else
		{
			for(int j=0;j<-deg[i];j++)from.push_back(i);
		}
	}
	assert(to.size()==from.size());
	for(int i=0;i<to.size();i++)
	{
		int sz=M+i;
		U[sz]=from[i];
		V[sz]=to[i];
		G[from[i]].push_back(sz);
	}
	vector<int>Es;
	bool ch=false;
	for(int i=0;i<N;i++)while(Gi[i]<G[i].size()&&G[i][Gi[i]]<M)
	{
		int u=i;
		Es.clear();
		do{
			assert(Gi[u]<G[u].size());
			int ei=G[u][Gi[u]++];
			Esi[u]=Es.size();
			Es.push_back(ei);
			u=V[ei];
			if(Esi[u]!=-1)
			{
				bool D=true;
				int L=Esi[u];
				for(int j=L;j<Es.size();j++)
				{
					if(Es[j]>=M)D=false;
				}
				if(D)
				{
					for(int j=L;j<Es.size();j++)del[Es[j]]=true;
					ch=true;
				}
				while(L<Es.size())
				{
					int ei=Es.back();
					Es.pop_back();
					Esi[U[ei]]=-1;
				}
			}
		}while(u!=i);
	}
	if(ch)solve();
}
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]--;
	}
	solve();
	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";
}