#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "biconex";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

vector<vector<int> > G;

vector<int> level;
vector<int> lowlink;
vector<bool> viz;

stack<int> st;
vector<vector<int> > biconex;

void dfs(int x, int lvl)
{
    level[x] = lowlink[x] = lvl;
    for(vector<int>::iterator itr = G[x].begin();
            itr != G[x].end();
            itr++)
    {
        if(level[*itr] == -1)
        {
            st.push(*itr);
            dfs(*itr, lvl + 1);
            lowlink[x] = min(lowlink[x], lowlink[*itr]);

            if(level[x] == lowlink[*itr])
            {
                int n = -1;
                vector<int> newBiconex;
                while(n != *itr)
                {
                    n = st.top();
                    st.pop();
                    newBiconex.push_back(n);
                }
                newBiconex.push_back(x);
                biconex.push_back(newBiconex);
            }
            
        }
        else
        {
            lowlink[x] = min(lowlink[x], level[*itr]);
        }
    }
}

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N, M;
    fin >> N >> M;
    G.resize(N + 1);
    level.resize(N + 1, -1);
    lowlink.resize(N + 1, -1);
    viz.resize(N + 1, false);

    for(int i = 0; i < M; i++)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    for(int i = 1; i <= N; i++)
    {
        if(level[i] == -1)
        {
            dfs(i, 0);
        }
    }

    fout << biconex.size() << "\n";
    for(vector<vector<int> >::iterator itr = biconex.begin();
            itr != biconex.end();
            itr++)
    {
        copy(itr->begin(), itr->end(), ostream_iterator<int>(fout, " "));
        fout << "\n";
    }

#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}