#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#define N 10005

using namespace std;

void cheng(vector<int> &a,vector<int> &b)
{
	int i,j,k,c[N],m;
	k = a.size()+b.size()-1;
	m = b.size();
	for ( i = 0 ; i < k ; i++)
	{
		//计算c[i]
		if( i >= m )	j = i-m+1;
		else	j = 0 ;
		for ( c[i] = 0 ; j <= i ; j++)
		{
			if( j < a.size() && (i-j) < b.size() )
				c[i] += a[j]*b[i-j];
		}
	}
	a.clear();
	for( i = 0 ; i < k ; i++)	a.push_back(c[i]);
}

int main()
{
	int i,j,n,m,num,x;
	int res[N];
	cin>>num;
	while (num--)
	{
		vector<int> a,b,c;
		cin>>m>>n;
		//m = 80;
		//n = 80;
		//a0---am,b0---bn
		for ( i = 0 ; i <= m ; i++)
		{
			//x = i+1;
			cin>>x;
			a.push_back(x);
		}
		for ( i = 0 ; i <= n ; i++)
		{
			//x = i+1;
			cin>>x;
			b.push_back(x);
			c.push_back(x);		//c留作备用
		}
		//计算。
		memset(res,0,sizeof(res));
		for ( i = 1 , res[0] = a[0] ; i <= m ; i++)
		{
			//a1*y……am*y^m,先计算y^m,c存储y^n
			for ( j = 0 ; j < c.size() ; j++)
				res[j] += c[j]*a[i];
			cheng(c,b);
			//show(c);
		}		
		for ( i = 0 ; i <= n*m ; i++)
		{
			if( !(i == n*m && res[i] == 0 && i == 0 ))
			{
				if( i != 0 )
					cout<<" ";
				cout<<res[i];
			}
			else	cout<<0;
		}
		cout<<endl;
	}
	return 0;
}