#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N], backend[N];
int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int ans = 0;
        int n, m, k;
        cin >> n >> m >> k;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
        for (int i = 1; i <= m; i++)
            cin >> b[i];
        sort(b + 1, b + 1 + m);
        for (int i = 1; i <= n - m + 1; i++)
        {
            int cnt = 0;
            memcpy(backend, a, sizeof a);
            sort(a + i, a + m - i + 2);
            for (int j = i; j <= m - i + 1; j++)
                if (a[j] == b[j - i + 1])
                    cnt++;
            if (cnt >= k)
                ans++;
            memcpy(a, backend, sizeof a);
        }
        cout << ans << endl;
    }
    return 0;
}