#include <bits/stdc++.h>
using namespace std;
struct node{
	int zhengfu,zhi,xi;
	bool operator<(const node &t)const{
		if(zhi!=t.zhi) return zhi>t.zhi;
		return xi>t.xi;
	}
};
vector<node> one;
vector<node> two;
vector<node> mul;
int main(){
	int z,x;
	while(cin>>z){
		if(z!=-1){
			cin>>x;
			if(x!=0) one.push_back({x<0?0:1,z,abs(x)});
		}
		else break;
	}
	while(cin>>z){
		if(z!=-1){
			cin>>x;
			if(x!=0) two.push_back({x<0?0:1,z,abs(x)});
		}
		else break;
	}
	for(auto u:one){
		for(auto v:two){
			int f=0;
			if(u.zhengfu==v.zhengfu) f=1;
			mul.push_back({f,u.zhi+v.zhi,u.xi*v.xi});
		}
	}
	sort(mul.begin(),mul.end());
	mul.push_back({0,0,0});
	int ans;
	if(!mul[0].xi)ans-=mul[0].xi;
	else ans+=mul[0].xi;
	for(int i=0;i<mul.size()-1;i++){
		if(mul[i].xi!=mul[i+1].xi){
			if(mul[i].zhi==0) cout<<ans;
			else{
				if(ans<0) cout<<"-";
				else if(i>0) cout<<"+";
				if(ans!=1) cout<<ans;
				cout<<"x^"<<mul[i].zhi;
			}
		}
		else{
			if(!mul[i].xi)ans-=mul[i].xi;
			else ans+=mul[i].xi;
		}
	}
	return 0;
}