AC

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>

using namespace std; string dfs(int u, int parent, const vector<vector>& graph) {

vector<string> children;
for (int v : graph[u]) {
    if (v != parent) {
        children.push_back(dfs(v, u, graph));
    }
}

sort(children.begin(), children.end());

string result = "(";
for (const string& child : children) {
    result += child;
}
result += ")";

return result;

} string getTreeSignature(const vector<vector>& graph) {

int n = graph.size();
vector<string> signatures;

for (int i = 0; i < n; i++) {
    signatures.push_back(dfs(i, -1, graph));
}
sort(signatures.begin(), signatures.end());
return signatures[0];

}

int main() {

int M;
cin >> M;

vector<string> treeSignatures(M);
map<string, int> firstOccurrence;

for (int i = 0; i < M; i++) {
    int N;
    cin >> N;
    
    vector<vector<int>> graph(N);
    vector<int> parent(N);
    for (int j = 0; j < N; j++) {
        cin >> parent[j];
        if (parent[j] != 0) {
            int u = j;
            int v = parent[j] - 1;
            graph[u].push_back(v);
            graph[v].push_back(u);
        }
    }
    string signature = getTreeSignature(graph);
    treeSignatures[i] = signature;
    if (firstOccurrence.find(signature) == firstOccurrence.end()) {
        firstOccurrence[signature] = i + 1;
    }
}
for (int i = 0; i < M; i++) {
    cout << firstOccurrence[treeSignatures[i]] << endl;
}

return 0;

}