#include<bits/stdc++.h>
#define ll long long    
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
    int x = 0; bool op = 0;
    char c = getchar();
    while(!isdigit(c))op |= (c == '-'), c = getchar();
    while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return op ? -x : x;
}
const int N = 1e6 + 10;
int n, k;
int dep[N], sz[N], son[N], d[N], F[N];
vector<int> G[N];
void dfs1(int u, int fa) {
    dep[u] = dep[fa] + 1; sz[u] = 1; F[u] = fa;
    for(int v : G[u]) {
        if(v == fa)continue;
        dfs1(v, u); sz[u] += sz[v];
        if(son[u] == 0 || d[v] + 1 > d[u]) {
            d[u] = d[v] + 1; son[u] = v;
        }
    }
    return ;
}
vector<int> ans;
void clr() {
    ans.clear();
    for(int i = 1; i <= n; i++)G[i].clear();
    for(int i = 1; i <= n; i++)d[i] = sz[i] = 0;
    return ;
}
void dfs2(int u, int fa, int s) {
    if(s == 0)return ;
    s--; ans.pb(u);
    for(int v : G[u]) {
        if(v == fa || s == 0)continue;
        dfs2(v, u, min(s, sz[v])); 
        s -= min(s, sz[v]); ans.pb(u);
    }
    return ;
}
void solve() {
    n = read(); k = read();
    // for(int i = 1; i < n; i++) {
    //     int u = read(), v = read();
    //     G[u].pb(v); G[v].pb(u);
    // }
    for(int i = 2; i <= n; i++) {
        int u = read();
        G[u].pb(i); G[i].pb(u);
    }
    dfs1(1, 0);
    int mx = 0;
    for(int i = 1; i <= n; i++) {
        if(dep[i] <= k)mx = max(mx, dep[i]);
    }
    int u = 1, c = 1, s = k - mx, lst = 0;
    for(; c <= mx; lst = u, u = son[u], c++) {
        ans.pb(u);
        for(int v : G[u]) {
            if(v == lst || v == son[u] || s == 0)continue;
            dfs2(v, u, min(s, sz[v])); s -= min(s, sz[v]); ans.pb(u);
        }
    }
    printf("%d\n", (int)ans.size() - 1);
    for(int u : ans)printf("%d ", u); putchar('\n');
    return clr(), void();
}
int main() { 
    int test = read();
    while(test--)solve();
    return 0;
}