#include"iostream"

#include"stdio.h"

#include"string.h"

#include"cmath"

#include"algorithm"

#include"queue"

#include"stack"

#include"set"

#include"map"

#include"vector"

using namespace std;

const int mx=;

int num[mx];

int HANDLE(int n)

{

    int i,tem=num[n-],ans=;

    for(i=n-;i>=;i--)

    {

        if(tem<num[i]) ans++;

        else tem=num[i];

    }

    return ans;

}

int main()

{

    int T,icase;

    cin>>T;

    for(icase=;icase<=T;icase++)

    {

        int n;

        cin>>n;

        for(int i=;i<n;i++)

            scanf("%d",&num[i]);

        printf("Case #%d: %d\n",icase,HANDLE(n));

    }

    return ;

}