//Δ_1005
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 11111;
const int MO = 1e9+7;
int n,a[N],b[N],t[N];
void ad(int x,int y){
    if(!x)
        return;
    while(x<=n){
        t[x]+=y;
        if(t[x]>=MO)
            t[x]-=MO;
        x+=x&-x;
    }
}
int qu(int x){
    LL y=0;
    while(x){
        y+=t[x];
        x-=x&-x;
    }
    return y%MO;
}
void solve(){
    memset(t,0,sizeof(t));
    int i;
    for(i=1;i<=n;i=i+1){
        ad(a[i],b[i]);
        b[i]=qu(a[i]-1);
    }
}
int main()
{
    int tc,tt,i,j,x,f;
    scanf("%d",&tc);
    for(tt=1;tt<=tc;tt++){
        scanf("%d",&n);
        for(i=1;i<=n;i=i+1)
            scanf("%d",a+i),b[i]=1;
        cout<<"Case #"<<tt<<": ";
        f=1;
        for(i=1;i<=n;i=i+1){
            if(f){
                x=0;
                f=0;
                for(j=1;j<=n;j=j+1)
                    x+=b[j],x%=MO,f|=b[j];
                solve();
            }
            cout<<x;
            if(i<n)
                cout<<' ';
        }
        cout<<endl;
    }
    return 0;
}