#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")

# include <iostream>
# include <algorithm>
using namespace std;

int a[101010];
int b[101010];

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    int tc;
    cin >> tc;
    for (int cs = 1; cs <= tc; ++cs) {
        cout << "Case #" << cs << ": ";
        int n, k;
        cin >> n >> k;
        for (int i = 0; i < n; ++i) {
        	cin >> a[i];
        }
        for (int i = 0; i < n; ++i) {
        	cin >> b[i];
        }
        long long ans = 0;
        for (int i = n - 1; i >= 0; --i) {
            int whereA = int(std::lower_bound(a + i + 1, a + n, a[i]) - a);
            int x = a[i];
            for (int j = i; j < whereA; ++j) {
                a[j] = x;
            }
            int whereB = int(std::lower_bound(b + i + 1, b + n, b[i]) - b);
            x = b[i];
            for (int j = i; j < whereB; ++j) {
                b[j] = x;
            }
            for (int j = i; j < n; ++j) {
                ans += abs(a[j] - b[j]) <= k;
            }
        }
        cout << ans << endl;
    }
    return 0;
}