C. Road to Cinema(线性规划）

题目链接：http://codeforces.com/problemset/problem/738/C

Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a ticket for starts in t minutes. There is a straight road of length sfrom the service to the cinema. Let's introduce a coordinate system so that the car rental service is at the point 0, and the cinema is at the point s.

There are k gas stations along the road, and at each of them you can fill a car with any amount of fuel for free! Consider that this operation doesn't take any time, i.e. is carried out instantly.

There are n cars in the rental service, i-th of them is characterized with two integers ci and vi — the price of this car rent and the capacity of its fuel tank in liters. It's not allowed to fuel a car with more fuel than its tank capacity vi. All cars are completely fueled at the car rental service.

Each of the cars can be driven in one of two speed modes: normal or accelerated. In the normal mode a car covers 1 kilometer in 2 minutes, and consumes 1 liter of fuel. In the accelerated mode a car covers 1 kilometer in 1 minutes, but consumes 2 liters of fuel. The driving mode can be changed at any moment and any number of times.

Your task is to choose a car with minimum price such that Vasya can reach the cinema before the show starts, i.e. not later than in t minutes. Assume that all cars are completely fueled initially.

Input

The first line contains four positive integers n, k, s and t (1 ≤ n ≤ 2·105, 1 ≤ k ≤ 2·105, 2 ≤ s ≤ 109, 1 ≤ t ≤ 2·109) — the number of cars at the car rental service, the number of gas stations along the road, the length of the road and the time in which the film starts.

Each of the next n lines contains two positive integers ci and vi (1 ≤ ci, vi ≤ 109) — the price of the i-th car and its fuel tank capacity.

The next line contains k distinct integers g1, g2, ..., gk (1 ≤ gi ≤ s - 1) — the positions of the gas stations on the road in arbitrary order.

Output

Print the minimum rent price of an appropriate car, i.e. such car that Vasya will be able to reach the cinema before the film starts (not later than in t minutes). If there is no appropriate car, print -1.

Examples

Input

3 1 8 10
10 8
5 7
11 9
3

Output

10

Input

2 2 10 18
10 4
20 6
5 3

Output

20

Note

In the first sample, Vasya can reach the cinema in time using the first or the third cars, but it would be cheaper to choose the first one. Its price is equal to 10, and the capacity of its fuel tank is 8. Then Vasya can drive to the first gas station in the accelerated mode in 3 minutes, spending 6 liters of fuel. After that he can full the tank and cover 2 kilometers in the normal mode in 4 minutes, spending 2 liters of fuel. Finally, he drives in the accelerated mode covering the remaining 3kilometers in 3 minutes and spending 6 liters of fuel.

借鉴大神的做法如下：

题意：有n个汽车，分别价格为c[i],载油量v[i],初始位置为0，电影院位置在s，有k个加油站，并且加油不消耗时间，我们要在不超过t时间内感到电影院，选择一辆最便宜的汽车，如果无方案，输出-1；每辆汽车有两种速度，1：1分钟1千米2升油。2：2分钟1千米1升油。

题解：大致就是二分求到达s的最小油量V，在可达范围内筛选最优值。能到达s的条件有：一辆车能在不加油的情况下通过两个加油站之间的最大距离，并且到达s时总时间不超过t。我们设在每一段不加油的距离为L（即两个加油站之间的距离）。用速度1经过X千米，速度2经过L-X千米，该段时间为T。

则有下列关系成立：

T=X+2*(L-X)  

V>=2*X+L-X

X>=0,L-X>=0

化简后得

T=2*L-X

X<=min(L,V-L)

则T=2*L-X=max（L，3*L-V）

接下来对油量从1到1e9进行二分，满足条件R=mid-1，V=mid，否则L=mid+1。

代码如下：

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=200010;
int n,k,s,t,ans,mg,mv,c[maxn],v[maxn],g[maxn];
int check(int v)
{
    if(v<mg)        //参数v为一辆车最大的载油量，mg为两个加油站之间的最长距离
        return 0;   //如果v小于最大值mg，即在一段行程中会遇到无油的情况，便不符合题意
    int tol=0;      //记录总时间
    for(int i=1;i<=k+1;i++)
    {
        tol+=max(g[i],g[i]*3-v);//线性规划
        if(tol>t)
            return 0;
    }
    return 1;
}
void half()
{
    int l=0,r=1e9;
    while(l<=r)
    {
        int mid=(l+r)/2;
        int x=check(mid);
        if(x==0)
            l=mid+1;
        else
            r=mid-1,mv=mid;//为真才更新mv值（切记）
    }
}
int main()
{
    ans=1e9+1;
    cin>>n>>k>>s>>t;
    for(int i=1;i<=n;i++)
        cin>>c[i]>>v[i];
    for(int i=1;i<=k;i++)
        cin>>g[i];
    sort(g+1,g+1+k);
    g[k+1]=s;
    for(int i=k+1;i>=2;i--)
        mg=max(mg,g[i]-=g[i-1]);
    half();     //二分函数版本，下方注释为大神借鉴版本
    //for(int l=0,r=1e9,m=l+r>>1;l<=r;check(m=l+r>>1)?r=m-1,mv=m:l=m+1);
    if(mv)
    {
        for(int i=1;i<=n;i++)
        {
            if(v[i]>=mv)
                ans=min(ans,c[i]);//在满足条件下筛选最优值
        }
    }
    if(ans>1e9)
        ans=-1;
    cout<<ans<<endl;
    return 0;
}