#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#include <sstream>
#include <list>
#include <assert.h>
#include <bitset>
#include <numeric>
#define debug() puts("++++")
#define gcd(a, b) __gcd(a, b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x)*(x))
#define ms(a,b) memset(a, b, sizeof a)
#define sz size()
#define be begin()
#define ed end()
#define pu push_up
#define pd push_down
#define cl clear()
#define lowbit(x) -x&x
//#define all 1,n,1
#define FOR(i,n,x)  for(int i = (x); i < (n); ++i)
#define freopenr freopen("in.in", "r", stdin)
#define freopenw freopen("out.out", "w", stdout)
using namespace std;
 
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const LL LNF = 1e17;
const double inf = 1e20;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 1e4 + 20;
const int maxm = 1e6 + 10;
const int mod = 1000000007;
const int dr[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dc[] = {0, 0, 1, -1, 1, -1, 1, -1};
const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline bool is_in(int r, int c) {
  return r >= 0 && r < n && c >= 0 && c < m;
}
inline int readInt(){ int x;  scanf("%d", &x);  return x; }

int sum[2][maxn];

void add(int i, int x, LL c){
  while(x <= n){
    sum[i][x] += c;
    if(sum[i][x] >= mod)  sum[i][x] -= mod;
    x += lowbit(x);
  }
}

int query(int i, int x){
  int ans = 0;
  while(x){
    ans += sum[i][x];
    if(ans >= mod)  ans -= mod;
    x -= lowbit(x);
  }
  return ans;
}

int dp[maxn], a[maxn];


int main(){
  int T;  cin >> T;
  for(int kase = 1; kase <= T; ++kase){
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i){
      scanf("%d", a + i);
      dp[i] = 1;
    }
    printf("Case #%d:", kase);
    int cur = 0;
    printf(" %d", n);
    cur = 1;
    for(int i = 2; i <= n; ++i, cur ^= 1){
      ms(sum[cur^1], 0);
      int ans = 0;
      for(int j = 1; j <= n; ++j){
        int tmp = query(cur^1, a[j]);
        add(cur^1, a[j], dp[j]);
        dp[j] = tmp;
        ans += tmp;
        if(ans >= mod)  ans -= mod;
      }
      if(ans == 0){
        for(int j = i; j <= n; ++j)  printf(" 0");
        break;
      }
      printf(" %d", ans);
    }
    printf("\n");
  }
  return 0;
}