#include <iostream>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
const int N=1e6+9,INF=1e9;
const double eps=1e-5;
typedef pair <int,int> PII;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
inline ll readll()
{
    ll x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
struct node{
    int to,nxt;
} edge[N];
int n,m,tot,d[N],head[N],ans[N],cnt,dfn[N],low[N],idx,st[N],top,IDX,tmp[N];
bool vis[N];
vector <int> g[N],e[N];
void addedge(int u,int v)
{
    edge[++tot].to=v,edge[tot].nxt=head[u],head[u]=tot;
}
void del(int u)
{
    vis[u]=true,d[u]=0,ans[++cnt]=u;
    for(int i=head[u];i;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(vis[v]==false) d[v]^=1;
    }
    for(int i=head[u];i;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(d[v]) del(v);
    }
}
void tarjan(int u,int fa)
{
    dfn[u]=low[u]=++idx,st[++top]=u;
    for(int i=0;i<g[u].size();i++)
    {
        int v=g[u][i];
        if(dfn[v]==0)
        {
            tarjan(v,u),low[u]=min(low[u],low[v]);
            if(dfn[u]<=low[v])
            {
                e[++IDX].push_back(u),e[u].push_back(IDX);
                while(st[top+1]!=v) e[IDX].push_back(st[top]),e[st[top]].push_back(IDX),top--;
            }
        }
        else if(v!=fa) low[u]=min(low[u],dfn[v]);
    }
}
void dfs(int u,int fa)
{
    vis[u]=true;
    for(int i=0;i<e[u].size();i++)
    {
        int v=e[u][i];
        if(vis[v]==false) dfs(v,u);
    }
    if(u<=n) return;
    int len=0,pos=0;
    for(int i=0;i<e[u].size();i++)
    {
        int v=e[u][i];
        if(v==fa) pos=i;
    }
    for(int i=pos;i<e[u].size();i++) tmp[++len]=e[u][i];
    for(int i=0;i<pos;i++) tmp[++len]=e[u][i];
    for(int i=2;i<=len;i++) ans[++cnt]=tmp[i]+(i&1)*n;
    if(len&1) ans[++cnt]=tmp[2]+n,ans[++cnt]=tmp[len];
    else ans[++cnt]=tmp[2]+n,ans[++cnt]=tmp[len]+n;
}
int main()
{
    #ifdef FILEIO
        freopen("in.in","r",stdin);
        freopen("out.out","w",stdout);
    #endif
    n=read(),m=read();
    for(int i=1;i<=m;i++)
    {
        int u=read(),v=read();
        addedge(u,v),addedge(v,u);
        d[u]^=1,d[v]^=1;
    }
    for(int i=1;i<=n;i++)
        if(d[i]) del(i);
    for(int u=1;u<=n;u++)
    {
        if(vis[u]) continue;
        for(int i=head[u];i;i=edge[i].nxt)
        {
            int v=edge[i].to;
            if(vis[v]==false) g[u].push_back(v);
        }
    }
    ans[++cnt]=-1;
    IDX=n;
    for(int i=1;i<=n;i++)
        if(dfn[i]==0) tarjan(i,0);
    for(int i=1;i<=n;i++) vis[i]=false;
    for(int i=1;i<=n;i++)
        if(vis[i]==false) dfs(i,0),ans[++cnt]=i;
    cout<<"0 "<<cnt<<'\n';
    for(int i=1;i<=cnt;i++)
    {
        if(ans[i]==-1) puts("2");
        else cout<<"1 "<<ans[i]<<'\n';
    }
    cerr<<endl<<1e3*clock()/CLOCKS_PER_SEC<<"ms";
    return 0;
}