#include <bits/stdc++.h>
#define int long long
#define ll long long
#define sz(x) (int)(x).size()
#define all(x) begin(x),end(x)
#define rep(i,a,b) for (int i=(a);i<(b);i++)
using namespace std;

string to_string (string s) {return s; }
template <typename T> string to_string(T v) {
    bool first = true;
    string res = "[";
    for (const auto & x : v) {
        if (!first) res += ", ";
        first = false;
        res += to_string(x);
    }
    res += "]";
    return res;
}

void dbg_out() { cout << endl;} 
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
    cout << ' ' << to_string(H);
    dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

int nbNodes, nbEdges;

void solve() {
    scanf("%lld %lld", &nbNodes, &nbEdges);
    printf("%lld\n", 2 * nbEdges);
    for (int i = 0; i < nbEdges; i ++)
    {
        int a, b;
        scanf("%lld %lld", &a, &b);
        printf("%lld %lld ", a, b);
        for (int j = 1; j <= nbNodes; j ++)
        {
            if (j != a && j != b)
                printf("%lld ", j);
        }
        printf("\n");
        for (int j = nbNodes; j > 0; j --)
        {
            if (j != a && j != b)
                printf("%lld ", j);
        }
        printf("%lld %lld\n", a, b);
    }
    return;
}

signed main(void) {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    solve();
    return 0;
}