#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int N, M;
    std::cin >> N >> M;
    
    std::vector<std::vector<int>> adj(N);
    for (int i = 0; i < M; i++) {
        int u, v;
        std::cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    std::vector<bool> vis(N);
    std::vector<int> dep(N), p(N);
    p[0] = -1;
    auto dfs = [&](auto &self, int x) -> void {
        vis[x] = true;
        for (auto y : adj[x]) {
            if (!vis[y]) {
                dep[y] = dep[x] + 1;
                p[y] = x;
                self(self, y);
            }
        }
    };
    dfs(dfs, 0);
    
    if (*std::max_element(dep.begin(), dep.end()) == N - 1) {
        std::cout << 2 * N << "\n";
        for (int i = 0; i < 2 * N; i++) {
            for (int x = 0; x < N; x++) {
                int c;
                if (dep[x] % 2 == i % 2) {
                    c = x;
                } else if (x != 0) {
                    c = p[x];
                } else {
                    c = 0;
                }
                std::cout << c << " \n"[x == N - 1];
            }
        }
        return 0;
    }
    
    int u = 0;
    std::vector<int> deg(N);
    for (int i = 1; i < N; i++) {
        deg[p[i]]++;
    }
    for (int i = 0; i < N; i++) {
        if (dep[i] > dep[u] && deg[i] > 1) {
            u = i;
        }
    }
    std::vector<bool> ef(N);
    int f = p[u];
    if (u != 0) {
        for (auto y : adj[f]) {
            ef[y] = true;
        }
    }
    
    int v = -1;
    for (int i = 0; i < N; i++) {
        if (p[i] == u) {
            if (v == -1 || !ef[i]) {
                v = i;
            }
        }
    }
    assert(v != -1);
    
    std::fill(vis.begin(), vis.end(), false);
    dep[v] = 0;
    std::swap(adj[v][0], *std::find(adj[v].begin(), adj[v].end(), u));
    if (!ef[v]) {
        if (u != 0) {
            std::swap(adj[u][0], *std::find(adj[u].begin(), adj[u].end(), f));
        }
    } else {
        std::partition(adj[u].begin(), adj[u].end(),
            [&](int i) {
                return p[i] == u;
            });
    }
    std::fill(p.begin(), p.end(), -1);
    dfs(dfs, v);
    
    std::cout << 2 * N << "\n";
    for (int i = 0; i < 2 * N; i++) {
        for (int x = 0; x < N; x++) {
            int c;
            if (dep[x] % 2 == i % 2) {
                c = x;
            } else if (x != v) {
                c = p[x];
            } else {
                c = u;
            }
            std::cout << c << " \n"[x == N - 1];
        }
    }
    
    return 0;
}