#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,ssse3,sse4a")
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(const auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int na, nb, w;
    cin >> na >> nb >> w;
    const int n = na + nb;
    vector<int> ma(n), ca(n);
    vector<pair<int, int> > vec(n);
    rep(i,na){
        cin >> ma[i] >> ca[i];
        vec[i] = {ca[i], i};
    }
    rep(i,nb){
        cin >> ma[na + i] >> ca[na + i];
        vec[na + i] = {ca[na + i], na + i};
    }
    sort(all(vec));
    int ans = INF;
    rep(i,n-1){
        bitset<10001> bt1, rbt1, bt2, rbt2, nbt, diff;
        bt1[0] = 1, rbt1[10000] = 1, bt2[0] = 1, rbt2[10000] = 1;
        const int st = ca[vec[i].second];
        for(int j = i; j < n; ++j){
            if(vec[j].second < na){
                const int c = ca[vec[j].second];
                const int m = ma[vec[j].second];
                nbt = (bt1 | (bt1 << m));
                if(bt2 != 1){
                    diff = (bt1 ^ nbt);
                    int mn = INF;
                    for(int k = diff._Find_first(); k <= w; k = diff._Find_next(k)){
                        const int hoge = bt2._Find_next(k-1);
                        if(hoge <= w) cmn(mn, hoge - k);
                        const int hoge2 = 10000 - rbt2._Find_next(9999 - k);
                        if(hoge2 != 0) cmn(mn, k - hoge2);
                    }
                    cmn(ans, max(c - st, mn));
                }
                bt1 = nbt, rbt1 = (rbt1 | (rbt1 >> m));
            }else{
                const int c = ca[vec[j].second];
                const int m = ma[vec[j].second];
                nbt = (bt2 | (bt2 << m));
                if(bt1 != 1){
                    diff = (bt2 ^ nbt);
                    int mn = INF;
                    for(int k = diff._Find_first(); k <= w; k = diff._Find_next(k)){
                        const int hoge = bt1._Find_next(k-1);
                        if(hoge <= w) cmn(mn, hoge - k);
                        const int hoge2 = 10000 - rbt1._Find_next(9999 - k);
                        if(hoge2 != 0) cmn(mn, k - hoge2);
                    }
                    cmn(ans, max(c - st, mn));
                }
                bt2 = nbt, rbt2 = (rbt2 | (rbt2 >> m));
            }
        }
    }
    cout << ans << "\n";
    return 0;
}


Measured memory_bytes: 3204