#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <memory.h>
#include <assert.h>

using namespace std;

const int maxC = 1000;
const int maxT = 100000;
const int maxN = 100000;
int testNumber = 0;

const long long mod = 1000000007;

long long a[maxC+1];
long long b[maxC+1];
long long dp[maxC+1];
int tt[maxN+1];
int bb[maxN+1];
int n,m,c;
int ans[maxC+1];

void solve() // solution
{
	memset(a, 0, sizeof(a));
	memset(b, 0, sizeof(b));
	for (int i = 0; i<n; ++i)    // we calculate amount of upper halves of each radius
	{
		int x = tt[i];
		a[x]++; 
	}
	for (int j = 0; j<m; ++j)    // we calculate amount of lower halves of each radius
	{
		int x = bb[j];
		b[x]++;
	}
	b[0] = 0;
	for (int i = 1; i <= c; ++i) a[i] *= b[i], a[i] %= mod; // we calculate amount of spheres of each radius we can build
	for (int i = 1; i <= c; ++i) dp[i] = a[i], b[i] = b[i - 1] + dp[i], b[i] %= mod; // base of dynamic programming 
	
	for (int len = 1; len <= c; ++len) // for each len-sequence
	{
		for (int i = 1; i <= c; ++i)
			dp[i] = a[i] * b[i - 1], dp[i] %= mod; // calculating dynamic programming array for each len-sequence
		for (int i = 1; i <= c; ++i)
			b[i] = b[i - 1] + dp[i], b[i] %= mod; // particular sums
		ans[len-1] = b[c]; // we know result for each len-sequence
	}
}


int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d", &n, &m, &c);
        for(int j = 0; j<n; ++j)
        {
            scanf("%d", &tt[j]); // reading upper halves radiuses
        }
        for(int j = 0; j<m; ++j)
        {
            scanf("%d", &bb[j]); // reading lower halves radiuses
        }
        solve();
        for(int i=0;i<c;++i)
        {
            printf("%d ", ans[i]); // writing answers
        }
        printf("\n");
    }
}