#include<bits/stdc++.h>
using namespace std;

int const MAXN=100001;
int n, m, ind = 1;
int p[MAXN], used[MAXN], vertex[MAXN];


vector<int> v[MAXN];
vector<int> ans, answer[MAXN];

void DFS(int i)
{
    used[i] = 1;
    vertex[i] = p[ind];
    ind++;
    int sz = v[i].size();
    for(int j=0;j<sz;j++)
    {
        int nb = v[i][j];
        if(!used[nb])
        {
            DFS(nb);
        }
    }
}

void DFS1(int i)
{
    used[i] = 1;
    ans.push_back(i);
    int sz = v[i].size();
    for(int j=0;j<sz;j++)
    {
        int nb = v[i][j];
        if(!used[nb])
        {
            DFS1(nb);
            ans.push_back(i);
        }
    }
}

void read()
{
    int x, y;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>p[i];
    }
    sort(p+1, p+n+1);
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    DFS(1);
    for(int i=1;i<=n;i++)
    {
        cout<<vertex[i]<<" ";
    }
    cout<<endl;
    memset(used, 0, sizeof(used));
    DFS1(1);
    memset(used, 0, sizeof(used));
    bool state = true;
    int day = 1;
    for(int i=0;i<ans.size();i++)
    {
        if(used[ans[i]])
        {
            if(state == true)
            {
                day++;
                answer[day].push_back(ans[i-1]);
            }
            state = false;
        }
        else state = true;
        used[ans[i]] = 1;
        answer[day].push_back(ans[i]);
    }
    cout<<day-1<<endl;
    for(int i=1;i<day;i++)
    {
        cout<<answer[i].size()<<" ";
        for(int j=0;j<answer[i].size();j++)
        {
            cout<<answer[i][j]<<" ";
        }
        cout<<endl;
    }
}



int main()
{
    freopen("taxi.in", "r", stdin);
    freopen("taxi.out", "w", stdout);
    read();
    return 0;
}