#include <bits/stdc++.h>
using namespace std;
const int inf = numeric_limits<int>::max();
const long long int linf = numeric_limits<long long int>::max();
const long long int MOD = 998244353;
long long int fast_mod(long long int abcd, long long int expp) {
  long long int res = 1;
  while (expp > 0) {
    if (expp % 2 == 1) res = (res * abcd) % MOD;
    abcd = (abcd * abcd) % MOD;
    expp /= 2;
  }
  return res % MOD;
}
long long int gcd(long long int a, long long int b) {
  long long int temppp = max(a, b);
  b = min(a, b);
  a = temppp;
  if (b == 0) return a;
  return gcd(b, a % b);
}
vector<int> v[500005];
int ans[500005];
int value;
void dfs(int ind) {
  ans[ind] = value--;
  for (auto it : v[ind]) {
    dfs(it);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 1; i < n + 2; i++) v[i].clear();
    int next[n];
    for (int i = 0; i < (n); ++i) {
      cin >> next[i];
      if (next[i] == -1) {
        next[i] = i + 2;
      }
    }
    for (int i = 0; i < (n); ++i) {
      v[next[i]].push_back(i + 1);
    }
    for (int i = 0; i < (n + 2); ++i) sort(v[i].begin(), v[i].end());
    value = n + 1;
    dfs(n + 1);
    bool ok = true;
    stack<int> st;
    int check[n + 1];
    for (int i = n - 1; i >= 0; i--) {
      while (!st.empty()) {
        int ind = st.top();
        if (ans[ind + 1] < ans[i + 1])
          st.pop();
        else
          break;
      }
      if (st.empty())
        check[i] = n + 1;
      else
        check[i] = st.top() + 1;
      st.push(i);
    }
    for (int i = 0; i < (n); ++i)
      if (check[i] != next[i]) {
        ok = false;
        break;
      }
    if (ok)
      for (int i = 1; i < n + 1; i++) cout << ans[i] << " ";
    else
      cout << -1;
    cout << "\n";
  }
  return 0;
}
