#include <bits/stdc++.h>
using namespace std;
vector<long long> g[500005];
long long ans[500005];
long long a[500005], b[500005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  int tc;
  cin >> tc;
  while (tc--) {
    long long n, i, j, k;
    cin >> n;
    stack<long long> s, p;
    for (i = 0; i < n + 2; i++) {
      g[i].clear();
      ans[i] = 0;
    }
    ans[n + 1] = 1000000007;
    for (i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] == -1) {
        g[0].push_back(i + 1);
      } else
        g[a[i]].push_back(i + 1);
    }
    k = n;
    for (i = n + 1; i >= 0; i--) {
      sort(g[i].begin(), g[i].end());
      if (i != 0 && !g[i].empty() && ans[i] == 0) {
        ans[i] = k;
        k--;
      }
      for (auto p : g[i]) {
        if (ans[p] == 0) {
          ans[p] = k;
          k--;
        }
      }
    }
    for (i = 0; i < n; i++) b[i] = n + 1;
    p.push(0);
    s.push(ans[1]);
    long long l;
    for (i = 2; i <= n; i++) {
      if (s.empty()) {
        s.push(ans[i]);
        p.push(i - 1);
        continue;
      }
      while (!s.empty() && s.top() < ans[i]) {
        l = p.top();
        b[l] = i;
        s.pop();
        p.pop();
      }
      s.push(ans[i]);
      p.push(i - 1);
    }
    j = 0;
    for (i = 0; i < n; i++) {
      if (a[i] == -1) continue;
      if (a[i] != b[i]) j = 1;
    }
    if (j) {
      cout << -1;
      cout << "\n";
      continue;
    }
    for (i = 1; i < n + 1; i++) cout << ans[i] << " ";
    cout << "\n";
  }
  return 0;
}
