#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;

void solve() {
    int n;
    cin >> n;
    vector<pair<int, int>> v(n);
    vector<int> id;
    for(auto &[l, r]: v) {
        cin >> l >> r, id.push_back(l);
        assert(l <= r);
    }
    sort(v.begin(), v.end(), [&](auto x, auto y) {
        if(x.second == y.second) return x.first <= y.first;
        return x.second < y.second;
    });
    sort(id.begin(), id.end());
    vector<int> ans;
    int last = 0;
    for(int i = 0; i < n; i++) {
        if(id[i] > last) last = id[i];
        else ++last;
        ans.push_back(last);
    }
    set<int> st(ans.begin(), ans.end());
    for(auto [l, r]: v) {
        auto it = st.lower_bound(l);
        if(it == st.end() or *it > r) {
            cout << "No" << endl;
            return;
        }
        st.erase(it);
    }
    cout << "yes" << endl;
    for(auto &i: ans) cout << i << " "; cout << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}