#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int M = 1000;
const int N = M * 3;
int t, n, s;
int p[N], w[N], x[N], y[N];
int G[N][N], h[N];
void Drop(int i, int x) {
    int &j = G[x][h[x]];
    if(h[x] > h[x-1] && h[x] > h[x+1]) {
        if(w[i] > w[j]) {
            Drop(j, x+1);
            j = i;
        } else Drop(i, x-1);
    } else if(h[x] > h[x-1]) {
        if(w[i] > w[j]) {
            Drop(j, x-1);
            j = i;
        } else Drop(i, x-1);
    } else if(h[x] > h[x+1]) {
        if(w[i] > w[j]) {
            Drop(j, x+1);
            j = i;
        } else Drop(i, x+1);
    } else G[x][++h[x]] = i;
}
int main() {
    freopen("coconuts.in", "r", stdin);
    freopen("coconuts.out", "w", stdout);
    scanf("%d", &t);
    while(t--) {
        memset(G, 0, sizeof(G));
        memset(h, 0, sizeof(h));
        scanf("%d", &n);
        for(int i=1; i<=n; i++) {
            scanf("%d %d", p+i, w+i);
            Drop(i, p[i]+M);
        }
        for(int i=1; i<=N; i++)
            for(int j=1; j<=h[i]; j++)
                x[G[i][j]] = j, y[G[i][j]] = i;
        for(int i=1; i<=n; i++)
            printf("%d %d\n", x[i], y[i]-M);
        printf("\n");
    }
    return 0;
}