#include <iostream>
#include <cstring>

#define ll long long

using namespace std;

const int N = 100010, r = 100000007;

ll f[N], tr[N], lower[N];
int n;

int lowbit(int x) {
    return x & -x;
}

void add(int x, ll c) {
    for (int i = x; i <= n; i += lowbit(i)) {
        tr[i] += c;
    }
}

ll sum(int x) {
    ll res = 0;
    for (int i = x; i; i -= lowbit(i))
        res += tr[i];
    return res;
}

int main() {
    while(1);
    ios::sync_with_stdio(false);

    int t;
    cin >> t;
    for (int Case = 1; Case <= t; Case++) {
        memset(tr, 0, sizeof tr);
        cin >> n;
        for (int i = 1; i <= n; i++)
            cin >> f[i];
        ll res = 0;
        for (int i = 1; i <= n; i++) {
            int y = f[i];
            lower[i] = sum(y - 1);
            add(y, 1);
            //res += R * (R - 1) / 2 - lower[i] * R;
        }
        memset(tr, 0, sizeof tr);
        for (int i = n; i; i--) {
            int y = f[i];
            ll R = sum(n) - sum(y);
            add(y, 1);
            res += R * (R - 1) / 2 - lower[i] * R;
        }
        cout << "Case #" << Case << ": " << res % r << endl;
    }
    return 10;
}