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 s from 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 3 kilometers in 3 minutes and spending 6 liters of fuel.

Source: codeforces | Difficulty: MEDIUM_HARD
Tags: Sorting

Greedy algorithms


Solutions:
import sys

def roadToCinema(V, S, T, stations):
	m = len(stations)
	t = 0
	stations.append(S)
	prev = 0
	for cur in stations:
		dis = cur - prev
		if dis > V:
			return False
		else:
			t += max(dis * 3 - V, dis)
		if t > T:
			return False
		prev = cur
	return True

def binSearch(S, T, stations):
	l = 0
	r = S * 2
	if T < S:
		return float('inf')
	while l + 1 < r:
		m = l + (r - l) // 2
		if roadToCinema(m, S, T, stations) == True:
			r = m
		else:
			l = m
	return r
line = sys.stdin.readline()
[N, M, S, T] = list(map(int, line.split(' ')))
aircrafts = []
for i in range(N):
	[c, v] = list(map(int, sys.stdin.readline().split(' ')))
	aircrafts.append([c, v])
stations = list(map(int, sys.stdin.readline().split(' ')))
stations.sort()
minVolume = binSearch(S, T, stations)
if minVolume == float('inf'):
	print(-1)
else:
	res = float('inf')
	for i in range(N):
		if aircrafts[i][1] >= minVolume:
			res = min(res, aircrafts[i][0])
	if res == float('inf'):
		print(-1)
	else:
		print(res)


import sys
input = sys.stdin.readline
N = int(200000.0 + 1)
(n, k, s, t) = map(int, input().split())
car = [list(map(int, input().split())) for _ in range(n)]
g = sorted(list(map(int, input().split()))) + [0]
g[k] = s - g[k - 1]
for i in range(k - 1, 0, -1):
	g[i] -= g[i - 1]

def is_valid(g, k, v, t):
	need = 0
	for i in range(k + 1):
		need += max(g[i], 3 * g[i] - v)
	return need <= t

def binary_search(g, k):
	(l, r) = (max(g), int(2000000000.0))
	while l < r:
		v = l + (r - l) // 2
		if is_valid(g, k, v, t):
			r = v
		else:
			l = v + 1
	return l
l = binary_search(g, k)
res = int(2000000000.0)
for i in range(n):
	if car[i][1] >= l:
		res = min(res, car[i][0])
print(-1 if res == int(2000000000.0) else res)