#include <bits/stdc++.h>
using namespace std;
long long int dxk[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long int dyk[] = {1, -1, 0, 0, 1, -1, 1, -1};
long long int ll_max(long long int a, long long int b, long long int c) {
  return max(a, max(b, c));
}
int int_max(int a, int b, int c) { return max(a, max(b, c)); }
long long int ll_min(long long int a, long long int b, long long int c) {
  return min(a, min(b, c));
}
int int_min(int a, int b, int c) { return min(a, min(b, c)); }
long long int max(int a, long long int b) { return max((long long int)a, b); }
long long int min(int a, long long int b) { return min((long long int)a, b); }
long long int min(long long int a, int b) { return min(a, (long long int)b); }
long long int max(long long int a, int b) { return max(a, (long long int)b); }
long long int dx[] = {0, 0, 1, -1};
long long int dy[] = {1, -1, 0, 0};
long long int power(long long int a, long long int b) {
  if (a == 1) return 1;
  if (b == 0) return 1;
  long long int c = power(a, b / 2);
  long long int res = 1;
  if (b % 2) {
    res = (c * c) % 1000000007;
    res *= a;
    res %= 1000000007;
  } else
    res = ((c * c) % 1000000007);
  return res;
}
long long int modInv(long long int a) {
  return power(a, 1000000007 - 2) % 1000000007;
}
long long int fact[1], inv[1];
void factorial(long long int n) {
  fact[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    fact[i] = fact[i - 1] * i;
    fact[i] %= 1000000007;
  }
}
void InvFactorial(long long int n) {
  inv[0] = 1;
  for (long long int i = 1; i <= n; i++) inv[i] = modInv(fact[i]);
}
long long int ncr(long long int n, long long int r) {
  if (n < r || n < 0 || r < 0) return 0;
  long long int b = inv[n - r];
  long long int c = inv[r];
  long long int a = fact[n] * b;
  a %= 1000000007;
  a *= c;
  a %= 1000000007;
  return a;
}
long long int Tree[2000001];
void update_max(int node, int start, int end, int i, long long int val) {
  if (start == end) {
    Tree[node] = val;
    return;
  }
  int mid = ((start + end) >> 1);
  if (i <= mid)
    update_max(2 * node + 1, start, mid, i, val);
  else
    update_max(2 * node + 2, mid + 1, end, i, val);
  Tree[node] = max(Tree[2 * node + 1], Tree[2 * node + 2]);
}
long long int query_max(int node, int start, int end, int l, int r) {
  if (start > end || end < l || start > r) return 0;
  if (start >= l && end <= r) return (Tree[node]);
  int mid = (start + end) / 2;
  long long int p1 = query_max(node * 2 + 1, start, mid, l, r);
  long long int p2 = query_max(node * 2 + 2, mid + 1, end, l, r);
  return max(p1, p2);
}
void solve(int countu) {
  int n;
  cin >> n;
  vector<int> v[n + 2];
  set<int> s;
  s.insert(n + 1);
  int a[n];
  for (long long int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] != -1) {
      s.insert(a[i]);
      v[a[i]].push_back(i + 1);
      continue;
    }
    set<int>::iterator it = s.upper_bound(i + 1);
    v[(*it)].push_back(i + 1);
  }
  vector<int> v1(n + 2);
  int ans = n;
  for (int i = n + 1; i >= 2; i--) {
    sort(v[i].begin(), v[i].end());
    for (long long int j = 0; j < v[i].size(); j++) {
      v1[v[i][j]] = ans;
      update_max(1, 1, n, v[i][j], ans);
      ans--;
    }
  }
  for (long long int i = 1; i < n + 1; i++) {
    int j = query_max(1, 1, n, i + 1, a[i - 1] - 1);
    if (j > v1[i]) {
      cout << "-1" << '\n';
      return;
    }
  }
  for (long long int i = 1; i < n + 1; i++) printf("%d ", v1[i]);
  cout << '\n';
}
int main() {
  int t = 1;
  scanf("%d", &t);
  int countu = 1;
  while (t--) {
    solve(countu);
    countu++;
  }
}
