#include<cstdio>
#include<vector>
#define min(a,b) a<b ? a : b;
using namespace std;
FILE *in = fopen("ctc.in", "r"), *out = fopen("ctc.out", "w");

int n, m, index = 1, nrComp = 0;
vector <int> graf[100001], S, vindex(100001, 0), lowlink(100001, 200001);
vector <int> compCurenta(100001, 0), viz(100001, 0);
vector <vector <int> > sol;

void SCC(int nod){
	S.push_back(nod);
	vindex[nod] = index;
	lowlink[nod] = index++;
	compCurenta[nod] = 1;
	viz[nod] = 1;
	int i, adiacent;
	
	for (i = 0; i < (int) graf[nod].size(); i++){
		adiacent = graf[nod][i];
		
		if (vindex[adiacent] == 0) {
			SCC( adiacent );
			lowlink[nod] = min (lowlink[adiacent], lowlink[nod]);
		}
		else if (compCurenta[adiacent] == 1)
			lowlink[nod] = min (vindex[adiacent], lowlink[nod]);
		
	}
	
	if (lowlink[nod] == vindex[nod]){
		nrComp++;
		vector <int> s;
		do {
			adiacent = S[S.size() - 1];
			S.pop_back();
			compCurenta[adiacent] = 0;
			s.push_back(adiacent);
		}
		while (nod != adiacent);
		sol.push_back(s);
	}
}

int main(){
	fscanf(in, "%d %d", &n, &m);
	
	int i, x, y;
	for (i = 0; i < m; i++) {
		fscanf(in, "%d %d", &x, &y);
		graf[x].push_back(y);
	}
	
	for (i = 1; i <= n ; i++){
		if (!viz[i]) {
			SCC(i);
			fprintf (out, "%d\n", nrComp);
			for (int k = 0; k < (int) sol.size(); k++){
				for (int j = 0; j < (int) sol[k].size(); j++) fprintf(out, "%d ", sol[k][j]);
				fprintf (out, "\n");
			}
		}
	}
	return 0;
}