#include <cstdio>

#include <cstring>

#include <algorithm>

#include <functional>

#include <vector>

#include <queue>

#define MAXN 100010

typedef long long ll;

using namespace std;

const int N = 1e5 + 5;

int a[N];

int b[N];

int d1[N];      //表示i处的LIS

int arr[N];

int main()

{

    int t,cas = 1;

    int n,len;

    scanf("%d",&t);

    while(t--)

    {

        scanf("%d%d",&n,&len);

        for(int i = 0; i <= n-1; i++)

        {

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

            b[i] = -a[i];            //为求右边的LIS

        }

        memset(arr,0x3f3f3f,sizeof(arr));

        for(int i = n-1; i >= 0; i--)   //nlog(n)求LIS

        {

            int x = lower_bound(arr,arr+n,b[i]) - arr;   //用log(n)查找,也可二分

            arr[x] = b[i];

            d1[i] = x+1;

        }

        int ans = 0,tlen = 0;

        memset(arr,0x3f3f3f,sizeof(arr));

        for(int i = len; i < n; i++)                        //arr中保存框左边的数最长lis

        {

            int x = lower_bound(arr,arr+n,a[i]) - arr;     //在前面找最大值比a[i]小的最长LIS

            ans = max(ans,x + d1[i]);

            x = lower_bound(arr,arr+n,a[i - len]) - arr;

            arr[x] =  a[i - len];

            tlen = max(x+1,tlen);                           //记录左边的最长长度

        }

        printf("Case #%d: ", cas++);

        ans = max(ans,tlen);                                //比较全在框左边的情况

        printf("%d\n",ans);

    }

    return 0;

}