There are two main kinds of events in the life of top-model: fashion shows and photo shoots. Participating in any of these events affects the rating of appropriate top-model. After each photo shoot model's rating increases by *a* and after each fashion show decreases by *b* (designers do too many experiments nowadays). Moreover, sometimes top-models participates in talk shows. After participating in talk show model becomes more popular and increasing of her rating after photo shoots become *c* and decreasing of her rating after fashion show becomes *d*.

Izabella wants to participate in a talk show, but she wants to do it in such a way that her rating will never become negative. Help her to find a suitable moment for participating in the talk show. 

Let's assume that model's career begins in moment 0. At that moment Izabella's rating was equal to *start*. If talk show happens in moment *t* if will affect all events in model's life in interval of time [*t*..*t* + *len*) (including *t* and not including *t* + *len*), where *len* is duration of influence.

Izabella wants to participate in a talk show, but she wants to do it in such a way that her rating will not become become negative before talk show or during period of influence of talk show. Help her to find a suitable moment for participating in the talk show.
In first line there are 7 positive integers *n*, *a*, *b*, *c*, *d*, *start*, *len* (1 ≤ *n* ≤ 3·10<sup class="upper-index">5</sup>, 0 ≤ *start* ≤ 10<sup class="upper-index">9</sup>, 1 ≤ *a*, *b*, *c*, *d*, *len* ≤ 10<sup class="upper-index">9</sup>), where *n* is a number of fashion shows and photo shoots, *a*, *b*, *c* and *d* are rating changes described above, *start* is an initial rating of model and *len* is a duration of influence of talk show.

In next *n* lines descriptions of events are given. Each of those lines contains two integers *t*<sub class="lower-index">*i*</sub> and *q*<sub class="lower-index">*i*</sub> (1 ≤ *t*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>, 0 ≤ *q* ≤ 1) — moment, in which event happens and type of this event. Type 0 corresponds to the fashion show and type 1 — to photo shoot. 

Events are given in order of increasing *t*<sub class="lower-index">*i*</sub>, all *t*<sub class="lower-index">*i*</sub> are different.
none
5 1 1 1 4 0 5
1 1
2 1
3 1
4 0
5 0
6
1 1 2 1 2 1 2
1 0
-1
10 1 1 1 2 0 10
1 1
2 1
3 0
4 0
5 1
6 1
7 1
8 1
9 1
10 1
5
import heapq

n, a, b, c, d, start, Len = list(map(int, input().strip().split()))

if start < 0:
    print(-1)
    quit()

normal_rating = [-b, a]
special_rating = [-d, c]
ts = []
for _ in range(n):
    ts.append(tuple(map(int, input().strip().split())))
ts.append((float("inf"), None))
i = 0
j = None
heap = []
current_rating = start
prev_rating = start
delta = 0
for j, (t, q) in enumerate(ts):
    if t < Len:
        current_rating += special_rating[q]
        heapq.heappush(heap, (current_rating, j))
    else:
        break

j_temp = j
while True:
    if ts[j][0] - ts[i][0] <= Len:  # take t[j] into gap
        current_rating += special_rating[ts[j][1]]           
        heapq.heappush(heap, (current_rating, j))
        j_temp += 1
    if ts[j][0] - ts[i][0] >= Len:  # drop t[i]
        delta += normal_rating[ts[i][1]] - special_rating[ts[i][1]]
        prev_rating += normal_rating[ts[i][1]]
        i += 1
        while heap and heap[0][1] < i:
            heapq.heappop(heap)
    
    j = j_temp
    
    if prev_rating < 0:
        print(-1)
        break
    #   impossible

    if (not heap) or heap[0][0] + delta >= 0:
        if j == 0:
            print(0)
        elif i == 0:
            print(max(-1, ts[j - 1][0] - Len) + 1)
        else: 
            print(max(ts[i - 1][0], ts[j - 1][0] - Len) + 1)
        break  # we find such t




        
