#include<bits/stdc++.h>

using namespace std;

const int maxn = 1e5+;

int a[maxn];

int g[maxn];

int f[maxn];

const int INF = 0x3f3f3f3f;

//#define LOCAL

int main()

{

#ifdef LOCAL

    freopen("in.txt","r",stdin);

#endif

    int T; scanf("%d",&T);

    for(int ks = ; ks <= T; ks++){

        int N,L,k ; scanf("%d%d",&N,&L);

        for(int i = ; i < N; i++) scanf("%d",a+i);

        fill(g+,g+N-L+,-INF);

        for(int i = N-; i >= L; i--){

            k = lower_bound(g+,g+N-i,a[i],greater<int>())-g;

            f[i] = k;

            g[k] = a[i];

        }

        memset(g+,0x3f,sizeof(int)*(N-L));

        int ans = ;

        for(int i = L; i < N; i++){

            k = lower_bound(g+,g+i-L+,a[i])-g;

            ans = max(k-+f[i],ans);

            k = lower_bound(g+,g+i-L+,a[i-L])-g;

            ans = max(k,ans);

            g[k] = a[i-L];

        }

        printf("Case #%d: %d\n",ks,ans);

    }

    return ;

}