#include <iostream>
#include <iomanip>
using namespace std;
const int N = 2010;
double a[N], b[N], c[N];
int last = 2010;                //#last is the minimum monomial which the constant isn't zero, to avoid the last space notation

int count_valid(double c[])     //count how many monomials are not zero, which will print first, by the way it will compute #last
{
    int cnt = 0;

    for (int i = 2000; i >= 0; i-- ) {
        if (c[i] != 0) {
            cnt++ ;
            last = i;
        } 
    }
    return cnt;
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int k1; cin >> k1;
    while (k1-- ) {
        int pow; double val;
        cin >> pow >> val;
        a[pow] = val;
    }
    int k2; cin >> k2;
    while (k2-- ) {
        int pow; double val;
        cin >> pow >> val;
        b[pow] = val;
    }
    for (int i = 0; i <= 1000; i++ ) {      //scan b[i]
        double cb = b[i];
        for (int j = 0; j <= 1000; j++ ) {  //scan a[j]
            double ca = a[j];
            c[i + j] += ca * cb;        //multiply two monomials, the power index will add and constant will be multiplied
        }
    }
    int cnt = count_valid(c);
    cout << cnt << " ";
    for (int i = 2000; i >= 0; i-- ) {      //scan the valid monomials
        if (c[i] != 0) {
            cout << i << " " << fixed << setprecision(1) << c[i];   //using iomanip to set precision
            if (i != last) cout << " ";     //avoid the last space notation
        }

    }
    return 0;
}