#include<bits/stdc++.h>
#define ll long long

using namespace std;
const int N=3e5+5,M=6e5+5;
int n,m,uu[M],vv[M],deg[N];
struct Edge{int v,id;};
vector<Edge>G[N];
bool mark[M];
struct State{int u,id;};
vector<State>stk;
int cur[N];
bool ins[N];
int dfs(int u,int p){
	stk.push_back({u,p}),ins[u]=1;
	for(int i=cur[u];i<deg[u];i=cur[u]){
		int v=G[u][i].v,id=G[u][i].id;
		cur[u]=i+1;
		if(!ins[v]){
			int nxt=dfs(v,id);
			if(nxt==0||nxt==u)continue;
			else return nxt;
		}
		else{
			mark[id]=1;
			while(!stk.empty()&&stk.back().u!=v)mark[stk.back().id]=1,ins[stk.back().u]=0,stk.pop_back();
			return v;
		}
	}
	if(!stk.empty())ins[stk.back().u]=0,stk.pop_back();
	return 0;
}
signed main()
{
//	freopen("dag.in","r",stdin),freopen("dag.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)scanf("%d%d",uu+i,vv+i),G[uu[i]].push_back({vv[i],i}),deg[uu[i]]++;
	for(int i=1;i<=n;i++)if(!ins[i])dfs(i,0);
	int cnt=0;
	vector<int>ans;
	for(int i=1;i<=m;i++)if(!mark[i])cnt++,ans.push_back(i);
	printf("%d %d\n",n,cnt);
	for(int it:ans)printf("%d %d\n",uu[it],vv[it]);
	return 0;
}