#include <fstream>
#include <vector>
#define NMAX 100005
#define MAX_LOG 16

using namespace std;

ifstream in("lca.in");
ofstream out("lca.out");

struct ok{
    int nod, nivel;
};

vector <int> children[NMAX];
ok euler[NMAX];
int log2[NMAX];
int k;
int table[NMAX][MAX_LOG];
int first[NMAX];

void dfs(int node, int niv)
{
    int i;
    euler[++k].nod = node;
    euler[k].nivel = niv;
    if (first[node] == 0)
        first[node] = k;
    for (i = 0; i < children[node].size(); ++i)
    {
        dfs(children[node][i], niv + 1);
        euler[++k].nod = node;
        euler[k].nivel = niv;
    }
}

void buildLog()
{
    int i;
    for (i = 2; i <= NMAX; ++i)
        log2[i] = log2[i / 2] + 1;
}

int query(int left, int right)
{
    int len = right - left + 1;
    int log = log2[len];

    return min(table[left][log], table[right - (1 << log) + 1][log]);
}

int main()
{
    int n, q, i, j, a, b, p;
    in >> n >> q;
    for (i = 2; i <= n; ++i)
    {
        in >> a;
        children[a].push_back(i);
    }

    k = 0;
    dfs(1, 1);

    for (i = 1; i <= k; ++i)
        out << euler[i].nod << " ";

    out << '\n';
    for (i = 1; i <= k; ++i)
        out << euler[i].nivel << " ";

    out << '\n';
    for (i = 1; i <= k; ++i)
        out << first[i] << " ";

    buildLog();

    for (p = 1; p <= MAX_LOG; ++p)
    {
        for (i = 0; i + (1 << p) < n; ++i)
            table[i][p] = min(table[i][p - 1], table[i + (1 << (p - 1))][p - 1]);
    }

    for (i = 1; i <= q; ++i)
    {
        in >> a >> b;

    }
    return 0;
}