#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n;
    std::cin >> n;
    
    std::vector<int> b(n);
    bool ok = true;
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
        if (b[i] > i + 1) {
            ok = false;
        }
        if (i && (b[i] < b[i - 1] || b[i] > b[i - 1] + 1)) {
            ok = false;
        }
    }
    if (!ok) {
        std::cout << "NO\n";
        return;
    }
    std::vector<int> a(n);
    a[0] = 1;
    for (int i = 1; i < n; i++) {
        a[i] = b[i] > b[i - 1] ? a[i - 1] + 1 : a[i - 1];
    }
    std::cout << "YES\n";
    for (int i = 0; i < n; i++) {
        std::cout << a[i] << " \n"[i == n - 1];
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}