#include <bits/stdc++.h>
#define debug cout<<"K"
#define ll long long
#define mod 1000000007

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	ll t;
	cin>>t;
	while(t>0)
	{
        ll n;
        cin>>n;
        ll sum=0;
        ordered_set s;
        map<ll,ll>mp;
        for(int i=0;i<n;i++)
        {
            ll x;
            cin>>x;
            sum+=x;
            mp[x]++;
            s.insert(x);
        }
        for(int i=0;i<n;i++)
        {
            ll atleast=n-s.order_of_key(i+1);
            ll atmost=n*n-sum-mp[i]*(n-i)+atleast;
            cout<<atleast<<" "<<atmost<<"\n";
        }
        
        t--;
	}
	return 0;
}