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

#include<bits/stdc++.h>

#define int long long
#define ll long long
#define ld long double
#define mkp make_pair
#define f first
#define s second
#define sqr(x) (x) * (x)
#define all(a) (a).begin(),(a).end()
#define y1 qywywywyw
#define x1 swjsjwqjq
#define x2 wquuqweuqwdj
#define y2 qwwqqkwkqw

 using namespace std;

 const int N = 2e5 + 121;
 int g[N],c[N],D[N],v[N],Xh,i,k,t,n,kk,s,l,r,m,mn,vh;

 inline int f(int x)
 {
     if(D[k] > x) return 0;
     int ans = 0;
    Xh = x / 2;
    for(i=0;i<=k;++i)
        if(D[i]<=Xh) ans+=D[i]; else
     {
         kk = x-D[i];
         ans+=kk + (D[i]-kk)*2;
     }

        return(ans<=t);
 }
 //signed
 //int
 main()
 {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

   // freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);

    cin>>n>>k>>s>>t;
     for(i=1;i<=n;++i)cin>>c[i]>>v[i];
     for(i=1;i<=k;++i)cin>>g[i];

     sort(g+1,g+k+1);

     g[0] = 0;
     g[k+1] = s;

      for(i=0;i<=k;++i)
        D[i] = g[i+1] - g[i];

        l=1;
        r=2e9;
         while(l+1<r)
         {
            m = (l+r)>>1;
            if(f(m))r=m; else l=m;
         }

         if(f(l))vh=l; else vh=r;

            mn = 1e9 + 1;
         for(i=1;i<=n;++i)
            if(v[i]>=vh) mn=min(mn,c[i]);

         if(mn == (int)(1e9) + 1) cout<<-1<<'\n'; else cout<<mn<<'\n';

    return 0;
 }
