Books Exchange

Books Exchange

There are n kids, each of them is reading a unique book. At the end of any day, the i-th kid will give his book to the pi-th kid (in case of i=pi the kid will give his book to himself). It is guaranteed that all values of pi are distinct integers from 1 to n (i.e. p is a permutation). The sequence pdoesn't change from day to day, it is fixed.

For example, if n=6 and p=[4,6,1,3,5,2] then at the end of the first day the book of the 1-st kid will belong to the 4-th kid, the 2-nd kid will belong to the 6-th kid and so on. At the end of the second day the book of the 1-st kid will belong to the 3-th kid, the 2-nd kid will belong to the 2-th kid and so on.

Your task is to determine the number of the day the book of the i-th child is returned back to him for the first time for every i from 1 to n

.Consider the following example: p=[5,1,2,4,3]

. The book of the 1-st kid will be passed to the following kids:

• after the 1-st day it will belong to the 5-th kid,
• after the 2-nd day it will belong to the 3-rd kid,
• after the 3-rd day it will belong to the 2-nd kid,
• after the 4-th day it will belong to the 1-st kid.

So after the fourth day, the book of the first kid will return to its owner. The book of the fourth kid will return to him for the first time after exactly one day.

You have to answer qindependent queries.

Input

The first line of the input contains one integer q(1≤q≤1000) — the number of queries. Then qqueries follow.

The first line of the query contains one integer n(1≤n≤2⋅105) — the number of kids in the query. The second line of the query contains n integers p1,p2,…,pn (1≤pi≤n, all pi are distinct, i.e. p is a permutation), where pi is the kid which will get the book of the i-th kid.It is guaranteed that ∑n≤2⋅105(sum of n over all queries does not exceed 2⋅105).

Output

For each query, print the answer on it: n integers a1,a2,…,an, where ai is the number of the day the book of the i-th child is returned back to him for the first time in this query.

Example

Input

Copy

6
5
1 2 3 4 5
3
2 3 1
6
4 6 2 1 5 3
1
1
4
3 4 1 2
5
5 1 2 4 3

Output

Copy

1 1 1 1 1 
3 3 3 
2 3 3 2 1 3 
1 
2 2 2 2 
4 4 4 1 4 

题解：实际上是求数组中有多少个环和环的大小，可以发现同一个环内的数字答案是一样的。可以用dfs求环并用一个标记数组记录范问过的元素，没有访问过的则是一个新环。

#include<bits/stdc++.h>
using namespace std;
const int MAX_N=2e5+5;
int a[MAX_N],b[MAX_N];
bool bk[MAX_N];
int sum;
void dfs(int k){
    if(bk[k]) return;
    sum++;
    bk[k]=true;
    dfs(a[k]);
    b[k]=sum;
}
int main() {
    int t;
    cin>>t;
    while(t--){
        int n;cin>>n;
        for(int i=1;i<=n;i++) scanf("%d",a+i);
        fill(bk+1,bk+n+1,false);
        for(int i=1;i<=n;++i)
            if(!bk[i]){
                sum=0;
                dfs(a[i]);
            }
        for(int i=1;i<=n;++i)
            if(i!=n) cout<<b[i]<<' ';
            else cout<<b[i]<<endl;
    }
    return 0;
}