#include<bits/stdc++.h>
using namespace std;
int main()
{
vector < pair<int, int> > arr;
int t,cnt=0;
cin>>t;
while(t--)
{
int t,n,k,l,i,s;
bool flag;
cin>>n;
cnt++;
for(i=0;i<n;i++)
cin>>k>>l,arr.push_back(make_pair(k,l));
sort(arr.begin(),arr.end());
flag=false;
int g=0;
for( i=n-1;i>=0;i--)
{
if(g<arr[i].second)
{
flag=true;
break;
}
g++;
}
if(flag)
{cout<<"Case "<<cnt<<": No ordering possible!"<<"\n";continue;}
cout<<"Case "<<cnt<<":";
for(i=n-1;i>=0;i--) printf(" %d",arr[i].first);
cout<<"\n";
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKQp7CiAgICB2ZWN0b3IgPCBwYWlyPGludCwgaW50PiA+IGFycjsKCiAgICBpbnQgdCxjbnQ9MDsKICAgIGNpbj4+dDsKICAgIHdoaWxlKHQtLSkKICAgIHsKICAgICAgICBpbnQgdCxuLGssbCxpLHM7CiAgICAgICAgYm9vbCBmbGFnOwogICAgICAgIGNpbj4+bjsKICAgICAgICBjbnQrKzsKICAgICAgICBmb3IoaT0wO2k8bjtpKyspCiAgICAgICAgY2luPj5rPj5sLGFyci5wdXNoX2JhY2sobWFrZV9wYWlyKGssbCkpOwogICAgICAgIHNvcnQoYXJyLmJlZ2luKCksYXJyLmVuZCgpKTsKICAgICAgICBmbGFnPWZhbHNlOwogICAgICAgIGludCBnPTA7CiAgICAgICAgZm9yKCBpPW4tMTtpPj0wO2ktLSkKCiAgICAgICAgICB7CiAgICAgICAgICAgIGlmKGc8YXJyW2ldLnNlY29uZCkKICAgICAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGZsYWc9dHJ1ZTsKICAgICAgICAgICAgICAgIGJyZWFrOwogICAgICAgICAgICAgICAgfQogICAgICAgICAgIGcrKzsKICAgICAgICAgIH0KICAgICAgICAgIGlmKGZsYWcpCiAgICAgICAgICAgIHtjb3V0PDwiQ2FzZSAiPDxjbnQ8PCI6IE5vIG9yZGVyaW5nIHBvc3NpYmxlISI8PCJcbiI7Y29udGludWU7fQogICAgICAgICAgICAgY291dDw8IkNhc2UgIjw8Y250PDwiOiI7CiAgICAgICAgICAgIGZvcihpPW4tMTtpPj0wO2ktLSkgcHJpbnRmKCIgJWQiLGFycltpXS5maXJzdCk7CiAgICAgICAgICAgIGNvdXQ8PCJcbiI7CiAgICB9CnJldHVybiAwOwp9Cg==