#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int N=15;
int n,m;
map<string,int> mp;
int a[N][N],b[N],idx,st[N];
string sa[N],sb[N];
bool check()
{
    int res[N];
    for(int i=1;i<=idx;++i) res[i]=0;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=idx;++j)
            res[j]+=st[i]*a[i][j];
    for(int i=1;i<=idx;++i)
        if(res[i]!=b[i]) return 0;
    return 1;
}
/*
2 3
NH4NO3 NaOH
NaNO3 NH3 H2O
*/
bool DFS(int nw)
{
    if(nw==n+1)
    {
        if(check())
        {
            if(st[1]!=1) cout<<st[1];
            cout<<sa[1];
            for(int i=2;i<=n;++i)
            {
                cout<<'+';
                if(st[i]!=1) cout<<st[i];
                cout<<sa[i];
            }
            cout<<'='<<sb[1];
            for(int i=2;i<=m;++i) cout<<'+'<<sb[i];
            return 1;
        }
        return 0;
    }
    for(int i=1;i<=10;++i)
    {
        st[nw]=i;
        if(DFS(nw+1)) return 1;
    }
    return 0;
}
int main()
{
    freopen("Sbfenjielu.in","r",stdin);
    freopen("Sbfenjielu.out","w",stdout);
    string s;
    cin>>n>>m;
    for(int i=1;i<=n;++i)
    {
        cin>>sa[i];
        s=sa[i];
        for(int j=0;j<s.size();++j)
        {
            int l=1;
            if(s[j]>='A'&&s[j]<='Z'&&s[j+1]>='a'&&s[j+1]<='z'&&j!=s.size()-1) ++l;
            string sub=s.substr(j,l);
            if(!mp.count(sub)) mp[sub]=++idx;
            if(j+l==s.size())
            {
                a[i][mp[sub]]+=1;
                break;
            }
            j+=l;
            if(s[j]>='2'&&s[j]<='9') a[i][mp[sub]]+=s[j]-'0';
            else --j,a[i][mp[sub]]+=1;
        }
    }
    for(int i=1;i<=m;++i)
    {
        cin>>sb[i];
        s=sb[i];
        for(int j=0;j<s.size();++j)
        {
            int l=1;
            if(s[j]>='A'&&s[j]<='Z'&&s[j+1]>='a'&&s[j+1]<='z'&&j!=s.size()-1) ++l;
            string sub=s.substr(j,l);
            if(!mp.count(sub)) mp[sub]=++idx;
            if(j+l==s.size())
            {
                b[mp[sub]]+=1;
                break;
            }
            j+=l;
            if(s[j]>='2'&&s[j]<='9') b[mp[sub]]+=s[j]-'0';
            else --j,b[mp[sub]]+=1;
        }
    }
    DFS(1);
    return 0;
}