#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define rep(i,a,n) for(int i=(a);i<=(n);++i)
#define dep(i,a,n) for(int i=(a);i>=(n);--i)
#define eps 1e-8
#define pi 3.1415926535897
#define sqr(x) ((x)*(x))
#define MAX(a,b) a=max(a,b)
#define MIN(a,b) a=min(a,b)
#define SZ(x) ((int)(x).size())
#define CPY(a,b) memcpy(a,b,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define POSIN(x,y) (1<=(x)&&(x)<=n&&1<=(y)&&(y)<=m)
#define all(x) (x).begin(),(x).end()
#define COUT(S,x) cout<<fixed<<setprecision(x)<<S<<endl
#define buli(x) (__builtin_popcountll(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...) 
#endif
typedef long long ll;
typedef double lf;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<lf,lf> pff;
typedef complex<double> CD;
const int inf=0x3f3f3f3f;
const int mo=1000000007;
inline void gn(long long&x){
    int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
    while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
template<class T1,class T2>inline void gn(T1&r,T2&s){gn(r),gn(s);}
template<class T1,class T2,class T3>inline void gn(T1&r,T2&s,T3&t){gn(r),gn(s),gn(t);}
template<class T1,class T2,class T3,class T4>inline void gn(T1&r,T2&s,T3&t,T4&u){gn(r),gn(s),gn(t),gn(u);}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
const int DX[]={1,0,-1,0},DY[]={0,1,0,-1};
ll powmod(ll a,ll b) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}
ll powmod(ll a,ll b,ll mo) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
//*******************************************

const int N=10111,M=1011;
int l,m,n,t,C;
int a[N],f[N],tot;
int T[M][N],dp[N][M],ans[N];
void modi(int *T,int x,int y){for(int i=x;i<=n;i+=(i&-i))T[i]=(T[i]+y)%mo;}
int que(int *T,int x){int ans=0;for(int i=x;i;i-=(i&-i))ans=(ans+T[i])%mo;return ans;}
void brute(){
    n=rand()%50+50;
    rep(i,1,n)a[i]=i;random_shuffle(a+1,a+1+n);
    static int dp[111][111],ans[111];
    rep(i,0,n)rep(j,0,n)dp[i][j]=0,ans[i]=0;
    rep(i,1,n){
        dp[a[i]][1]=1;
        rep(j,2,n){
            rep(k,1,a[i]-1)dp[a[i]][j]=(dp[a[i]][j]+dp[k][j-1])%mo;
        }
        rep(j,1,n)upmo(ans[j],dp[a[i]][j]);
    }
    rep(i,1,n)printf("%d%c",ans[i],i==n?'\n':' ');
}
void work(){
    scanf("%d",&n);rep(i,1,n)scanf("%d",&a[i]);
    rep(i,0,n)f[i]=0;
    tot=1;
    rep(i,1,n){
        int p=lower_bound(f+1,f+1+tot,a[i])-f;
        if(p==tot+1)f[++tot]=a[i];
        else f[p]=a[i];
    }
    tot--;
    rep(i,1,tot)rep(j,0,n)T[i][j]=0;
    rep(i,0,n)ans[i]=0;
    rep(i,1,n){
        dp[i][1]=1;
        rep(j,2,tot)dp[i][j]=que(T[j-1],a[i]);
        rep(j,1,tot)modi(T[j],a[i],dp[i][j]);
        rep(j,1,tot)ans[j]=(ans[j]+dp[i][j])%mo;
    }
    rep(i,1,n)printf("%d%c",ans[i],i==n?'\n':' ');
}
int main(){
#ifdef LOCAL
    freopen("E.in","r",stdin);//freopen("E.out","w",stdout);
#endif
    scanf("%d",&C);rep(_,1,C){
        printf("Case #%d: ",_);
#ifdef LOCAL
        brute();
#endif
        work();
    }
    return 0;
}