This time, you are supposed to find A*B where A and B are two polynomials.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (i=1, 2, ..., K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10, 0 <= NK < ... < N2 < N1 <=1000.

 

Output Specification:

For each test case you should output the product of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate up to 1 decimal place.

Sample Input

2 1 2.4 0 3.22 2 1.5 1 0.5

Sample Output

3 3 3.6 2 6.0 1 1.6

 

1 #include
     
       2 #include
      
        3 #include
       
         4  5 double str1[1001],str2[1001],ans[2002]; 6 int main() 7 { 8     int n,m,zi,xi,cnt=0; 9     int i,j;10     scanf("%d",&n);11     for( i=0; i
        
         =0; i--)36     {37         if( ans[i])38             printf(" %d %.1f",i,ans[i]);39     }40     return 0;41 }