#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10;
const long long INF = 1e18;
const long long inf = -1e18;
const long long MOD = 1e9 + 7;
const long long base = 1000 * 1000 * 1000;
int gcd(int a, int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
void solve() {
  int n;
  cin >> n;
  int v[n + 1];
  int mp[220];
  for (int i = 1; i <= n; ++i) {
    cin >> v[i];
    mp[i] = 1;
  }
  for (int i = 1; i <= n; ++i) {
    int ans = v[v[i]];
    while (ans != v[i]) {
      mp[i]++;
      ans = v[ans];
    }
    cout << mp[i] << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T;
  cin >> T;
  while (T--) solve();
}
