#include <cstdio>

#include <cstring>

using namespace std;

#define MAX_NUM 105

int a_num, b_num;

int a[MAX_NUM], b[MAX_NUM];

int c[MAX_NUM * MAX_NUM];

int poly[][MAX_NUM * MAX_NUM];

int poly_num;

void input()

{

    scanf("%d%d", &a_num, &b_num);

    for (int i = ; i <= a_num; i++)

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

    for (int i = ; i <= b_num; i++)

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

}

void add_c(int poly[], int a)

{

    for (int i = ; i <= poly_num; i++)

        c[i] += a * poly[i];

}

void add_poly(int last[], int next[])

{

    memset(next, , sizeof(int) * MAX_NUM * MAX_NUM);

    for (int i = ; i <= b_num; i++)

    {

        for (int j = ; j <= poly_num; j++)

            next[i + j] += b[i] * last[j];

    }

    poly_num += b_num;

}

void work()

{

    memset(c, , sizeof(c));

    for (int i = ; i <= b_num; i++)

    {

        poly[][i] = b[i];

    }

    poly_num = b_num;

    c[] = a[];

    add_c(poly[], a[]);

    for (int i = ; i <= a_num; i++)

    {

        add_poly(poly[(i - ) & ], poly[i & ]);

        add_c(poly[i & ], a[i]);

    }

    while (c[poly_num] == )

        poly_num--;

    printf("%d", c[]);

    for (int i = ; i <= poly_num; i++)

        printf(" %d", c[i]);

    puts("");

}

int main()

{

    int case_num;

    scanf("%d", &case_num);

    for (int i = ; i < case_num; i++)

    {

        input();

        work();

    }

}