#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

typedef unsigned long long int ULL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

const int maxn =   +;

int a[maxn];

int c[maxn];

int n;

int dpR_min[maxn];

int ans[maxn];

int pos[maxn];

int f;

int lowbit (int x)//得到x二进制末尾0的个数的2次方 2^num

{

    return x&(-x);

}

void add (int pos,int val)//在第pos位加上val这个值

{

    while (pos<=n) //n是元素的个数

    {

        c[pos] += val;        pos += lowbit(pos);

    }

    return ;

}

int get_sum (int pos) //求解：1--pos的总和

{

    int ans = ;

    while (pos)

    {

        ans += c[pos];        pos -= lowbit(pos);

    }

    return ans;

}

void work ()

{

    scanf("%d",&n);

    for (int i=; i<=n; ++i)

    {

        scanf("%d",&a[i]);

        pos[a[i]]=i;

    }

    memset(c,,sizeof c);

    for (int i=n; i>=; --i)

    {

        dpR_min[i] = get_sum(a[i]-);

        add(a[i],);

    }

    for (int i=;i<=n;++i)

    {

        int end = pos[a[i]] + dpR_min[pos[a[i]]];//看看它最右能去哪里

        //如果这个数字是要去右边

        int tR = end - pos[a[i]];

        //去左边

        int tL = end - a[i];

        ans[a[i]] = max(tR,tL);

    }

    printf ("Case #%d:",++f);

    for (int i=;i<=n;++i)

    {

        printf (" %d",ans[i]);

    }

    printf ("\n");

}

int main()

{

#ifdef local

    freopen("data.txt","r",stdin);

#endif

    int t;

    scanf("%d",&t);

    while (t--) work();

    return ;

}