#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<limits.h>
#include<time.h>
#include<stdlib.h>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#define LL long long
int inf = 1000000005;
using namespace std;
int a[100005];
LL dp1[100005], dp2[100005];
struct node
{bool isnew;int pos;int pre;
}note[100005];
bool cmp(int a, int b)
{return a > b;
}
template <class T>
int rupper_bound(T *a, T *end, T key) {int n = end - a;if(n == 0) return INT_MAX;if (a[n-1] > key) return n-1;if (a[0] <= key) return INT_MAX;int l = 0, r = n - 1;while(r - l > 1) {int m = (l+r) >> 1;if (a[m] > key) l = m;else r = m;}return l;
}
int main()
{int T;scanf("%d", &T);int cse = 1;while(T--){int n, l;scanf("%d%d", &n, &l);for(int i = 1; i <= n; i++)scanf("%d", &a[i]);a[0] = -inf;int max1 = 0, max2 = 0;for(int i = n; i > l; i--){int pos = upper_bound(dp1, dp1 + max1, a[i], cmp) - dp1;if(pos == max1){note[i].isnew = 1;note[i].pos = max1;dp1[max1++] = a[i];}else{note[i].isnew = 0;note[i].pos = pos;note[i].pre = dp1[pos];dp1[pos] = a[i];}}int ans = 0;LL s = -inf;int len = 0;for(int i = 1; i <= n - l + 1; i++){int pos = rupper_bound(dp1, dp1 + max1, s);if(pos == INT_MAX) ans = max(ans, len);else ans = max(ans, pos + 1 + len);int x = upper_bound(dp2, dp2 + max2, a[i]) - dp2;if(x == max2){len = max2 + 1;s = a[i];dp2[max2++] = a[i];}else{len = x + 1;s = a[i];dp2[x] = a[i];}if(note[i + l].isnew){max1--;}else{dp1[note[i + l].pos] = note[i + l].pre;}}printf("Case #%d: %d\n", cse++, ans);}return 0;
}