#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1e7 + 10;

int n, m, p, q, x;
struct Node
{
	int a, b;
	bool operator <(const Node t)const
	{
		return t.b < b;
	}
}a[N], b[N], c[N], d[N];

int main()
{
	while (1)
	{
		scanf("%d", &x);
		if (x == -1) break;
		a[++ n].b = x;
		scanf("%d", &a[n].a);
	}
	while (1)
	{
		scanf("%d", &x);
		if (x == -1) break;
		b[++ m].b = x;
		scanf("%d", &b[m].a);
	}
	
	for (int i = 1; i <= n; i ++ )
	{
		for (int j = 1; j <= m; j ++ )
		{
			c[ ++ p].a = a[i].a * b[j].a;
			c[p].b = a[i].b + b[j].b;
		}
	}
	
	stable_sort(c + 1, c + p + 1);
	
	c[p + 1].a = c[p + 1].b = 0x3f3f3f3f;
	
	for (int i = 1; i <= p; i ++ )
	{
		int j = i, num = 0;
		while (c[i].b == c[j].b)
		{
			j ++ ;
		}
		for (int k = i; k < j; k ++ )
		{
			num += c[k].a;
		}
		
		i = j - 1;
		
		if (num == 0) continue;
		else if (c[i].b == 0)
		{
			if (num < 0) printf("%d",num);
			else printf("+%d", num);
		}
		else if (num > 0 && i == 1) 
		{
			printf("%dx^%d", num, c[i].b);
		}
		else
		{
			if (num < 0) printf("%dx^%d", num, c[i].b);
			else printf("+%dx^%d", num, c[i].b);
		}
	}
	puts("");
	return 0;
}