POLYMUL - Polynomial Multiplication

Sam and Dean fight the supernatural creatures to protect the humans. Now they have come across a creature called the Vedala, which are always found in pairs. Each Vedala can be represented by a polynomial. Both the Vedalas need to be killed at once or else they can't be killed. They can be killed only by using the product of the two polynomials representing the two Vedala. Help Sam and Dean find the product of the polynomials fast, so they can do their work. 

Input

First line contains an integer T (≤ 10), number of test cases.

Each test case will have n (n ≤ 10000), maximum degree of the polynomials on the first line. 

Next two lines will have n+1 space separated integers each representing the coefficients of first and second polynomials respectively.

All input coefficients values are <=1000.

Output

For each test case output a line of 2n space separated integers indicating coefficients of the polynomial created after multiplication.

Example

Input:
2
2
1 2 3
3 2 1
2
1 0 1
2 1 0

Output:
3 8 14 8 3
2 1 2 1 0

Explanation

1st test case n=2, the polynomials are x^2 + 2x + 3 and 3x^2 + 2x + 1.

On multiplying we get 3x^4 + 8x^3 + 14x^2 + 8x + 3 and hence the answer is 3 8 14 8 3.

2nd test case n=2, the polynomials are x^2 + 1 and 2x^2 + x. 

On multiplying we get 2x^4 + x^3 + 2x^2 + x and hence the answer is 2 1 2 1 0. 


Added by:Abhra
Date:2014-02-12
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64

hide comments
2015-08-17 04:57:41 Eddy Cael
Easy with fft.
2015-06-16 14:02:16 prateek goyal
@Abhra output contain 2n integers or 2n+1 integers ??
2015-05-30 19:55:19 Muhammad Rifayat Samee (Sanzee)
getting WA....Need some test cases...
I am using FFT
2015-03-05 10:26:26 mkrjn99
Took 3 days to get AC, but totally worth it!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.