1
#include <bits/stdc++.h>
2
using namespace std;
3
#define int long long
4
const int N = 1e5 + 100;
5
const int MOD = 1e9 + 7;
6
int n, fac[N];
7

8
struct Node {
9
    int v, id;
10
    friend bool operator<(const Node a, const Node b) {
11
        if (a.v == b.v)
12
            return a.id > b.id;
13
        return a.v < b.v;
14
    }
15
};
16

17
Node v[N];
18
struct ST {
19
    Node mn[18][N];
20
    Node *a;
21
    int size;
22
    void init(Node *a, int size) {
23
        this->a = a;
24
        memset(mn, 0x3f, sizeof(mn));
25
        for (int i = 1; i <= size; i++) {
26
            mn[0][i] = a[i];
27
        }
28
        for (int j = 1; j <= 16; j++) {
29
            for (int i = 1; i <= size; i++) {
30
                mn[j][i] = min(mn[j - 1][i], mn[j - 1][i + (1 << (j - 1))]);
31
            }
32
        }
33
    }
34
    Node qry(int l, int r) {
35
        int len = log2(r - l + 1);
36
        return min(mn[len][l], mn[len][r - (1 << len) + 1]);
37
    }
38
} st;
39

40
int fastPow(int a, int p) {
41
    int ans = 1, cur = a;
42
    while (p >= 1) {
43
        if (p & 1) {
44
            (ans *= cur) %= MOD;
45
        }
46
        (cur *= cur) %= MOD;
47
        p /= 2;
48
    }
49
    return ans;
50
}
51

52
int inv(int x) { return fastPow(x, MOD - 2); }
53

54
int calFac(int x) {
55
    if (!fac[x]) {
56
        fac[x] = calFac(x - 1) * x % MOD;
57
    }
58
    return fac[x];
59
}
60

61
int calC(int from, int select) {
62
    if (select == 0 || from == select)
63
        return 1;
64
    return calFac(from) * inv(calFac(select)) % MOD *
65
           inv(calFac(from - select)) % MOD;
66
}
67

68
int solve_sub(int l, int r, int lower) {
69
    // cout << "DEBA " << l << "~" << r << endl;
70
    if (l > r)
71
        return 1;
72
    Node nd = st.qry(l, r);
73
    if (nd.v != lower) {
74
        return 0;
75
    }
76
    if (l == r) {
77
        return 1;
78
    }
79
    int mid = nd.id;
80
    int upper = r - mid;
81
    int ways = calC(r - l, upper);
82
    // cout << "DEBB " << l << "~" << r << ": " << mid << " " << ways << " "
83
    // << lower << " " << nd.v << endl;
84
    int left = solve_sub(l, mid - 1, lower);
85
    int right = solve_sub(mid + 1, r, lower + 1);
86
    return left * right % MOD * ways % MOD;
87
}
88

89
void solve(int id) {
90
    cin >> n;
91
    for (int i = 1; i <= n; i++) {
92
        cin >> v[i].v;
93
        v[i].id = i;
94
    }
95
    st.init(v, n);
96
    cout << "Case #" << id << ": " << solve_sub(1, n, 1) << endl;
97
}
98

99
signed main() {
100
    int T;
101
    cin >> T;
102
    fac[0] = 1;
103
    for (int i = 1; i <= T; i++)
104
        solve(i);
105
    return 0;
106
}