#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 2333

int n;
ll X[sz],Y[sz];
ll xmn=1e9,xmx=-1,ymn=1e9,ymx=-1;

ll id(int x,int y){return ll(1e9+10)*(x+1)+(y+1);}
unordered_map<ll,ll>ans;
unordered_map<ll,int>pp;
unordered_map<ll,ll>maxlen;

struct seg {
    ll y,l,r;
    const bool operator < (const seg &x) const {return y==x.y?MP(l,r)<MP(x.l,x.r):y<x.y;}
};

set<seg>S;
void merge(set<seg>::iterator &it) {
    while (233) {
        while (next(it)!=S.end()&&it->y==next(it)->y&&it->r>=next(it)->l) {
            seg s=seg{it->y,it->l,next(it)->r};
            S.erase(next(it)),S.erase(it);
            it=S.insert(s).first;
        }
        while (it!=S.begin()&&it->y==prev(it)->y&&it->l<=prev(it)->r) {
            seg s=seg{it->y,prev(it)->l,it->r};
            S.erase(prev(it)),S.erase(it);
            it=S.insert(s).first;
        }
        if (it->l==it->r) S.erase(it++);
        else return;
    }
}
void extend(set<seg>::iterator it, ll len) {
    assert(len);
    ll x=it->l,y=it->y,r=it->r;
    assert(len<=r-x);
    S.erase(it);
    auto it1=S.insert({y+len,x,x+len}).fir;
    auto it2=S.insert({y,x+len,r}).fir;
    merge(it1),merge(it2);
}

bool check(ll R) {
    if (R<=xmx) return 0;
    set<seg>_S=S;
    unordered_map<ll,ll>_ans=ans;
    S.erase(prev(S.end()));
    auto _=S.begin();
    assert(_->l<=R);
    if (_->l==R) S.erase(_);
    else {
        ll y=_->y,l=_->l;
        S.erase(_);
        S.insert({y,l,R});
    }
    while (233) {
        auto it=S.begin();
        ll x=it->l,y=it->y;
        assert(it->r != it->l);
        if (pp[id(x,y)]) {
            ll len=min(maxlen[id(x,y)],it->r-x);
            assert(len);
            ans[id(x,y)]=len;
            extend(it,len);
            continue;
        }
        if (S.size()!=1u) return S=_S,ans=_ans,0;
        if (y>ymx) return 1;
    }
}

void output(){
    cout<<"YES\n";
    rep(i,1,n) cout<<ans[id(X[i],Y[i])]<<" \n"[i==n];
}

void clear() {
    pp.clear();
    ans.clear();
    maxlen.clear();
    S.clear();
    xmn=1e9,xmx=-1,ymn=1e9,ymx=-1;
}

void work() {
    cin>>n;
    rep(i,1,n) cin>>X[i]>>Y[i],pp[id(X[i],Y[i])]=1;
    xmn=1e9,xmx=-1,ymn=1e9,ymx=-1;
    rep(i,1,n) chkmin(xmn,X[i]),chkmax(xmx,X[i]),chkmin(ymn,Y[i]),chkmax(ymx,Y[i]);
    #define NO return clear(),cout<<"NO"<<'\n',void()
    if (!pp.count(id(xmn,ymn))) NO;
    rep(i,1,n) maxlen[id(X[i],Y[i])]=1.5e9;
    rep(i,1,n) rep(j,1,n) if (i!=j&&X[j]>=X[i]&&Y[j]>=Y[i]) chkmin(maxlen[id(X[i],Y[i])],max(X[j]-X[i],Y[j]-Y[i]));
    S.insert(seg{ll(1e18),-ll(1e18),xmn}),S.insert(seg{ymn,xmn,ll(1e18)});
    
    while (233) {
        auto it=S.begin();
        merge(it);
        assert(it!=S.end());
        assert(S.size()!=1u);
        ll x=it->l,y=it->y;
        if (!pp.count(id(x,y))) {
            if (check(x)) return output(),clear();
            if ((int)S.size()!=3) NO;
            it=S.begin();
            ll xx=it->r,yy=next(it)->y;
            if (xx>xmx&&yy>ymx) return output(),clear();
            NO;
        }
        else {
            ll u=next(it)->y-y;
            if (maxlen[id(x,y)]<=u) {
                ll len=maxlen[id(x,y)];
                ans[id(x,y)]=len;
                assert(len);
                extend(it,len);
                continue;
            }
            if (check(x+u)) return output(),clear();
            it=S.begin();
            while (233) {
                assert(it!=prev(S.end())&&it!=S.end());
                it=next(it);
                ll x=it->l,y=it->y;
                ll r=it->r-x;
                ll u=next(it)->y-y;
                assert(u&&r);
                if (!pp[id(x,y)]) NO;
                if (maxlen[id(x,y)]<=min(u,r)||r<=u) {
                    ll len=min({maxlen[id(x,y)],r,u});
                    ans[id(x,y)]=len;
                    assert(len);
                    extend(it,len);
                    break;
                }
            }
        }
    }
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    int T; cin>>T;
    while (T--) work();
    return 0;
}