Problem: The only difference between easy and hard versions is constraints.

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 p_i-th kid (in case of i = p_i the kid will give his book to himself). It is guaranteed that all values of p_i are distinct integers from 1 to n (i.e. p is a permutation). The sequence p doesn'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 q independent queries.

Input

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

The first line of the query contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of kids in the query. The second line of the query contains n integers p_1, p_2, ..., p_n (1 ≤ p_i ≤ n, all p_i are distinct, i.e. p is a permutation), where p_i is the kid which will get the book of the i-th kid.

It is guaranteed that ∑ n ≤ 2 ⋅ 10^5 (sum of n over all queries does not exceed 2 ⋅ 10^5).

Output

For each query, print the answer on it: n integers a_1, a_2, ..., a_n, where a_i 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


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


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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e9 + 7;
const int MAX = (2e5) + 5;
const int INF = 1e7;
const int N = MAX;
int parent[N];
int ranks[N] = {0};
int freq[N] = {0};
int size[N] = {0};
std::ifstream in("input.txt");
std::ofstream out("output.txt");
vector<long long> vec(MAX), del(MAX), pt(MAX);
multiset<long long> ms;
map<long long, long long> mp;
unordered_map<long long, long long> ump;
vector<pair<long long, long long> > vp;
set<pair<long long, long long> > se;
unordered_set<long long> use;
long long find_set_pc(long long v) {
  if (v == parent[v]) return v;
  return parent[v] = find_set_pc(parent[v]);
}
void make_set_ubr(long long v) {
  parent[v] = v;
  ranks[v] = 0;
  size[v] = 1;
}
void union_sets_ubr(long long a, long long b) {
  a = find_set_pc(a);
  b = find_set_pc(b);
  if (a != b) {
    if (ranks[a] < ranks[b]) swap(a, b);
    parent[b] = a;
    if (ranks[a] == ranks[b]) ranks[a]++;
  }
}
void union_sets_ubs(long long a, long long b) {
  a = find_set_pc(a);
  b = find_set_pc(b);
  if (a != b) {
    if (size[a] < size[b]) swap(a, b);
    parent[b] = a;
    size[a] += size[b];
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, m, u, v, q, x, y, l1, l2, d;
  cin >> q;
  while (q--) {
    cin >> n;
    for (long long i = 0; i <= n; ++i) make_set_ubr(i);
    for (long long i = 1; i <= n; ++i) {
      cin >> d;
      union_sets_ubs(d, i);
    }
    for (long long i = 1; i <= n; ++i) {
      cout << size[find_set_pc(i)] << " ";
    }
    cout << endl;
  }
  return 0;
}