Stepan is a very experienced olympiad participant. He has n cups for Physics olympiads and m cups for Informatics olympiads. Each cup is characterized by two parameters — its significance c_{i} and width w_{i}.

Stepan decided to expose some of his cups on a shelf with width d in such a way, that:  there is at least one Physics cup and at least one Informatics cup on the shelf,  the total width of the exposed cups does not exceed d,  from each subjects (Physics and Informatics) some of the most significant cups are exposed (i. e. if a cup for some subject with significance x is exposed, then all the cups for this subject with significance greater than x must be exposed too). 

Your task is to determine the maximum possible total significance, which Stepan can get when he exposes cups on the shelf with width d, considering all the rules described above. The total significance is the sum of significances of all the exposed cups.


-----Input-----

The first line contains three integers n, m and d (1 ≤ n, m ≤ 100 000, 1 ≤ d ≤ 10^9) — the number of cups for Physics olympiads, the number of cups for Informatics olympiads and the width of the shelf.

Each of the following n lines contains two integers c_{i} and w_{i} (1 ≤ c_{i}, w_{i} ≤ 10^9) — significance and width of the i-th cup for Physics olympiads.

Each of the following m lines contains two integers c_{j} and w_{j} (1 ≤ c_{j}, w_{j} ≤ 10^9) — significance and width of the j-th cup for Informatics olympiads.


-----Output-----

Print the maximum possible total significance, which Stepan can get exposing cups on the shelf with width d, considering all the rules described in the statement.

If there is no way to expose cups on the shelf, then print 0.


-----Examples-----
Input
3 1 8
4 2
5 5
4 2
3 2

Output
8

Input
4 3 12
3 4
2 4
3 5
3 4
3 5
5 2
3 4

Output
11

Input
2 2 2
5 3
6 3
4 2
8 1

Output
0



-----Note-----

In the first example Stepan has only one Informatics cup which must be exposed on the shelf. Its significance equals 3 and width equals 2, so after Stepan exposes it, the width of free space on the shelf becomes equal to 6. Also, Stepan must expose the second Physics cup (which has width 5), because it is the most significant cup for Physics (its significance equals 5). After that Stepan can not expose more cups on the shelf, because there is no enough free space. Thus, the maximum total significance of exposed cups equals to 8.

Difficulty: interview

Starter code:

Solutions:
n, m, d = list(map(int, input().split()))

a = []
b = []

for i in range(n):
    a.append(list(map(int, input().split())))

for i in range(m):
    b.append(list(map(int, input().split())))

a = sorted(a, key=lambda x: x[0] + (1- x[1] * 1e-10))
b = sorted(b, key=lambda x: x[0] + (1- x[1] * 1e-10))

tc, td = 0, 0

tc += a[-1][0]
tc += b[-1][0]
td += a[-1][1]
td += b[-1][1]

ai = n - 1
bi = m - 1

if td > d:
    print(0)
    return

while ai > 0:
    t = ai - 1
    if td + a[t][1] <= d:
        td += a[t][1]
        tc += a[t][0]
        ai -= 1
        continue
    else:
        break
    
cmax = tc

while bi > 0:
    bi -= 1
    tc += b[bi][0]
    td += b[bi][1]
    
    while td > d and ai < n:
        tc -= a[ai][0]
        td -= a[ai][1]
        ai += 1
    
    if ai == n:
        break
    
    if td <= d:
        cmax = max(cmax, tc)
        
print(cmax)

n, m, d = list(map(int, input().split()))

a = []
b = []

for i in range(n):
    a.append(list(map(int, input().split())))

for i in range(m):
    b.append(list(map(int, input().split())))

a = sorted(a, key=lambda x: x[0] + (1- x[1] * 1e-10))
b = sorted(b, key=lambda x: x[0] + (1- x[1] * 1e-10))

tc, td = 0, 0

tc += a[-1][0]
tc += b[-1][0]
td += a[-1][1]
td += b[-1][1]

ai = n - 1
bi = m - 1

if td > d:
    print(0)
    return

while ai > 0:
    t = ai - 1
    if td + a[t][1] <= d:
        td += a[t][1]
        tc += a[t][0]
        ai -= 1
        continue
    else:
        break
    
cmax = tc

while bi > 0:
    bi -= 1
    tc += b[bi][0]
    td += b[bi][1]
    
    while td > d and ai < n:
        tc -= a[ai][0]
        td -= a[ai][1]
        ai += 1
    
    if ai == n:
        break
    
    if td <= d:
        cmax = max(cmax, tc)
        
print(cmax)

n, m, d = map(int, input().split())
ph = [[int(j) for j in input().split()] for i in range(n)]
inf = [[int(j) for j in input().split()] for i in range(m)]
for i in range(n):
    ph[i][1] = -ph[i][1]
for i in range(m):
    inf[i][1] = -inf[i][1]
ph.sort(reverse=True)
inf.sort(reverse=True)
sw, sc = 0, 0
for p in inf:
    sc += p[0]
    d += p[1]
ans = 0
z = m - 1
for p in ph:
    sc += p[0]
    d += p[1]
    #print(sc, d)
    while z > 0 and d < 0:
        sc -= inf[z][0]
        d -= inf[z][1]
        z -= 1
    #print(sc, d)
    if d >= 0:
        ans = max(ans, sc)
print(ans)