#include <bits/stdc++.h>
#define debug(x) cout<< #x << "=" << x <<endl;
using namespace std;
const int maxn=20001;
typedef long long LL;

int n,k,nn;
int a[maxn];
int zone[maxn];
int ask(int p) { return (p-1)/k+1; }

int sh[maxn];
void modify(int p,int v)
{
    for (int i=p; i<=n; i+=i&(-i))
        sh[i]+=v;
}
int sum(int p)
{
    int ret=0;
    for (int i=p; i; i-=i&(-i))
        ret+=sh[i];
    return ret;
}
int main(){
    for (int T; scanf("%d", &T)!=EOF; )
        for (int ans1, ans2, tt=1; T--; tt++)
        {
            scanf("%d%d", &n, &k);
            nn=ask(n);
            for (int i=1; i<=nn; i++) zone[i]=(i-1)*k+1;
            ans1=ans2=0;
            for (int i=1; i<=n; i++)
            {
                scanf("%d", &a[i]);
                a[i]=zone[ask(a[i])]++;
                ans2=max(ans2, abs(a[i]-i));
            }
            for (int i=1; i<=n; i++) sh[i]=0;
            for (int i=n; i; i--)
            {
                ans1+=sum(a[i]);
                modify(a[i], 1);
            }
            printf("Case %d: %d\n", tt, ans1-ans2);
        }
    return 0;
}