#include<bits/stdc++.h>
using namespace std;
struct xs{
	int xi;
	int zh;
}dxs1[1000+10],dxs2[1000+10],dxs3[2000+10];
unordered_map<int,int> ds1,ds2,ds3;
bool cmp(xs a,xs b)
{
	return a.zh>b.zh;
}
int main()
{
	int a,b;
	char c;
	while(1)
	{
		scanf("%d",&a);
		if(a==-1)break;
		scanf("%d",&b);
		ds1[a]+=b;
		scanf(" ");
	}
	while(1)
	{
		scanf("%d",&a);
		if(a==-1)break;
		scanf("%d",&b);
		ds2[a]+=b;
		scanf(" ");
	}
	int s1=0;
	for (auto& n : ds1) {
		s1++;
   		dxs1[s1].xi=n.second;
   		dxs1[s1].zh=n.first;
	}
	int s2=0;
	for (auto& n : ds2) {
		s2++;
   		dxs2[s2].xi=n.second;
   		dxs2[s2].zh=n.first;
	}
	for(int i=1;i<=s1;i++)
	{
		for(int j=1;j<=s2;j++)
		{
			ds3[dxs1[i].zh+dxs2[j].zh]+=dxs1[i].xi*dxs2[j].xi;
		}
	}
	int s3=0;
	for (auto& n : ds3) {
		s3++;
   		dxs3[s3].xi=n.second;
   		dxs3[s3].zh=n.first;
	}
	sort(dxs3+1,dxs3+s3,cmp);
	for(int i=1;i<=s3;i++)
	{
		if(i!=1&&dxs3[i].xi>=0)	cout<<'+';
		if(dxs3[i].xi==0)
		{
			
		}
		else if(dxs3[i].zh==0)
		{
			cout<<dxs3[i].xi;
		}
		else if(dxs3[i].xi==1)
		{
			cout<<"x^"<<dxs3[i].zh;
		}
		else
		{
			cout<<dxs3[i].xi<<"x^"<<dxs3[i].zh;
		}
	}
	return 0;
}