#include "iostream"
#include "vector"
#include "utility"
#include "algorithm"
using namespace std;
vector<int>l;
vector<int>r;
pair<vector<int>, vector<int>>p;

int first_loop(int n, int k)
{
    for(int i = 0;i<n;i++)
    {
        string s; int x;
        cin>>s>>x;
        l.push_back(x);
    }
    sort(l.begin(), l.end(), greater<int>());
    p.first = l;
    int num1 = n+k;
    for(int i = 0; i<l.size();i++)
    {
        if(num1 <= l[i])
        {
            break;
        }else
        {
            while(num1>l[i])
            {
                num1-=l[i];
            }
        }
    }
    return num1;
}
int second_loop(int n, int l){
    for(int i = 0;i<n;i++){
        string s; int x;
        cin>>s>>x;
        r.push_back(x);
    }
    sort(r.begin(), r.end(), greater<int>());
    p.second = r;
    int num1 = n+l;
    for(int i = 0; i<r.size();i++)
    {
        if(num1 <= r[i])
        {
            break;
        }else
        {
            while(num1>r[i])
            {
                num1-=r[i];
            }
        }
    }
    return num1;
}
int main()
{
    int n, k, l;
    cin>>n>>k;
    int x = first_loop(n, k);
    cin>>l;
    int x2 = second_loop(k, l);
    if (x == n+k)
        x = 0;
    if (x2==n+k)
        x2 = 0;
    if (x == 0 && x2 == 0)
        cout<<0<<endl;
    else
        cout<<x<<x2<<endl;
    return 0;
}