1 1 2 2
1000000000 1000000000
1
 1 1 1000000000 1000000000
100 1000000000
1
 1 1 10 18
5 6
5
 2 1 1000000000 2000000000
111 999999999
101 999999998
1
 4 13 400 600
13 30
1 19
1 160
1 113
58 73 15 319 194 362 128 157 336 162 77 90 96
 1 15 100 200
283 8
30 58 16 45 80 82 55 95 24 23 86 28 51 47 20
 3 2 300 400
24 68
13 65
15 113
127 177
 1 1 2 1
1 10
1
 4 2 7 15
10 9
4 4
9 3
4 10
1 6
 2 1 1000000000 2000000000
111 1000000000
101 1000000000
5
 2 1 1000000000 2000000000
111 999999998
101 999999998
1
 1 1 1000000000 1000000000
1 1000000000
1

1000000000
 -1
 5
 111
 1
 -1
 -1
 -1
 4
 101
 -1
 -1

import sys
input=sys.stdin.readline
from collections import deque
import bisect
n,k,s,t=map(int,input().split())
c=[]
for i in range(n):
    x=[int(p) for p in input().split()]
    c.append(x)
a=[int(x) for x in input().split()]
a.sort()
a.insert(0,0)
a.append(s)
b=[]
for i in range(1,k+2):
    b.append(a[i]-a[i-1])
et=(2*s-t)
d=[]
for i in range(n):
    if c[i][1]>=max(b):
        d.append(c[i])
b.sort()        
if et>t:
    print(-1)
    exit(0)

p=[]
for i in range(len(b)):
    p.append(min(et,b[i])*2+(b[i]-min(et,b[i])))
    et-=min(et,b[i])
d.sort()

for i in range(len(d)):
    j=bisect.bisect(p,d[i][1])
    print(j,d[i])
    if j==len(p):
            print(d[i][0])
            exit(0)

print(-1)            

        