#include<cstdio>
#include<algorithm>
#include<vector>
#include<deque>
#include<string>
#include<iostream>
#include<tuple>
#include<utility>
#include<set>
#include<queue>
using namespace std;
typedef long long int llint;
const llint big=((llint)1<<(llint)30);
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define pub push_back
#define res resize
//JOI 2017 semiexp O(NlogN)
//3:25~
//Tmin 
int main(void){
	llint N,M,K,A,B,C,T,ans=0,i,j,it,bef,stenum,minit,nokori;
	priority_queue<tuple<llint,llint,llint>> kyu;//next_ste_num,minite,nokori_ste
	cin>>N>>M>>K>>C>>A>>B>>T;
	cin>>bef;
	bef--;
	for(i=1;i<M;i++){
		cin>>it;
		it--;
		stenum=min((T-bef*A+C)/C,it-bef);
		ans+=max((llint)0,stenum);
		minit=bef*A;
		nokori=it-bef;
		kyu.push(mt(min((T-minit-stenum*B+C)/C,nokori-stenum),minit+stenum*B,nokori-stenum));
		
		//if(min((T-bef*A+C)/C,it-bef)<=0){printf("hsdlakj\n");}
		bef=it;
	}
	it=N;
	stenum=min((T-bef*A+C)/C,it-bef);
	ans+=max((llint)0,stenum);
	minit=bef*A;
	nokori=it-bef;
	kyu.push(mt(min((T-minit-stenum*B+C)/C,nokori-stenum),minit+stenum*B,nokori-stenum));
	//if(min((T-bef*A+C)/C,it-bef)<=0){printf("asaj\n");}
	K-=M;
	for(i=0;i<K;i++){
		stenum=get<0>(kyu.top());
		minit=get<1>(kyu.top());
		nokori=get<2>(kyu.top());
		kyu.pop();
		if(stenum<=0){break;}
		ans+=stenum;
		//if(ans==0){printf("de%d\n",i);}
		kyu.push(mt(min((T-minit-stenum*B+C)/C,nokori-stenum),minit+stenum*B,nokori-stenum));
		//if(min((T-minit-stenum*B+C)/C,nokori-stenum)<=0){printf("ko%d\n",i);}
	}
	cout<<ans-1<<endl;
}
### Prompt

Generate a Cpp solution to the following problem:

The JOI Railways is the only railway company in the Kingdom of JOI. There are $N$ stations numbered from $1$ to $N$ along a railway. Currently, two kinds of trains are operated; one is express and the other one is local.

A local train stops at every station. For each $i$ ($1 \leq i < N$), by a local train, it takes $A$ minutes from the station $i$ to the station ($i + 1$).

An express train stops only at the stations $S_1, S_2, ..., S_M$ ($1 = S_1 < S_2 < ... < S_M = N$). For each $i$ ($1 \leq i < N$), by an express train, it takes $B$ minutes from the station $i$ to the station ($i + 1$).

The JOI Railways plans to operate another kind of trains called "semiexpress." For each $i$ ($1 \leq i < N$), by a semiexpress train, it takes $C$ minutes from the station $i$ to the station ($i + 1$). The stops of semiexpress trains are not yet determined. But they must satisfy the following conditions:

* Semiexpress trains must stop at every station where express trains stop.
* Semiexpress trains must stop at $K$ stations exactly.



The JOI Railways wants to maximize the number of stations (except for the station 1) to which we can travel from the station 1 within $T$ minutes. The JOI Railways plans to determine the stops of semiexpress trains so that this number is maximized. We do not count the standing time of trains.

When we travel from the station 1 to another station, we can take trains only to the direction where the numbers of stations increase. If several kinds of trains stop at the station $i$ ($2 \leq i \leq N - 1$), you can transfer between any trains which stop at that station.

When the stops of semiexpress trains are determined appropriately, what is the maximum number of stations (except for the station 1) to which we can travel from the station 1 within $T$ minutes?

Task

Given the number of stations of the JOI Railways, the stops of express trains, the speeds of the trains, and maximum travel time, write a program which calculates the maximum number of stations which satisfy the condition on the travel time.

Input

Read the following data from the standard input.

* The first line of input contains three space separated integers $N$, $M$, $K$. This means there are $N$ stations of the JOI Railways, an express train stops at $M$ stations, and a semiexpress train stops at $K$ stations,
* The second line of input contains three space separated integers $A$, $B$, $C$. This means it takes $A$, $B$, $C$ minutes by a local, express, semiexpress train to travel from a station to the next station, respectively.
>li> The third line of input contains an integer $T$. This means the JOI Railways wants to maximize the number of stations (except for the station 1) to which we can travel from the station 1 within $T$ minutes.
* The $i$-th line ($1 \leq i \leq M$) of the following $M$ lines contains an integer $S_i$. This means an express train stops at the station $S_i$.



Output

Write one line to the standard output. The output contains the maximum number of stations satisfying the condition on the travel time.

Constraints

All input data satisfy the following conditions.

* $2 \leq N \leq 1 000 000 000．$
* $2 \leq M \leq K \leq 3 000．$
* $K \leq N．$
* $1 \leq B < C < A \leq 1 000 000 000．$
* $1 \leq T \leq 10^{18}$
* $1 = S_1 < S_2 < ... < S_M = N$



Sample Input and Output

Sample Input 1


10 3 5
10 3 5
30
1
6
10


Sample Output 1


8


In this sample input, there are 10 stations of the JOI Railways. An express train stops at three stations 1, 6, 10. Assume that the stops of an semiexpress train are 1, 5, 6, 8, 10. Then, among the stations 2, 3, ...10, we can travel from the station 1 to every station except for the station 9 within 30 minutes.

For some $i$, the travel time and the route from the station 1 to the station $i$ are as follows:

* From the station 1 to the station 3, we can travel using a local train only. The travel time is 20 minutes.
* From the station 1 to the station 7, we travel from the station 1 to the station 6 by an express train, and transfer to a local train. The travel time is 25 minutes.
* From the station 1 to the station 8, we travel from the station 1 to the station 6 by an express train, and transfer to a semiexpress train. The travel time is 25 minutes.
* From the station 1 to the station 9, we travel from the station 1 to the station 6 by an express train, from the station 6 to the station 8 by a semiexpress train, and from the station 8 to the station 9 by a local train. In total, the travel time is 35 minutes.



Sample Input 2


10 3 5
10 3 5
25
1
6
10


Sample Output 2


7


Sample Input 3


90 10 12
100000 1000 10000
10000
1
10
20
30
40
50
60
70
80
90


Sample Output 2


2


Sample Input 4


12 3 4
10 1 2
30
1
11
12


Sample Output 4


8


Sample Input 5


300 8 16
345678901 123456789 234567890
12345678901
1
10
77
82
137
210
297
300


Sample Output 5


72


Sample Input 6


1000000000 2 3000
1000000000 1 2
1000000000
1
1000000000


Sample Output 6


3000


Creative Commonse License

The 16th Japanese Olympiad in Informatics (JOI 2016/2017) Final Round





Example

Input

10 3 5
10 3 5
30
1
6
10


Output

8

### Response

```cpp
#include<cstdio>
#include<algorithm>
#include<vector>
#include<deque>
#include<string>
#include<iostream>
#include<tuple>
#include<utility>
#include<set>
#include<queue>
using namespace std;
typedef long long int llint;
const llint big=((llint)1<<(llint)30);
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define pub push_back
#define res resize
//JOI 2017 semiexp O(NlogN)
//3:25~
//Tmin 
int main(void){
	llint N,M,K,A,B,C,T,ans=0,i,j,it,bef,stenum,minit,nokori;
	priority_queue<tuple<llint,llint,llint>> kyu;//next_ste_num,minite,nokori_ste
	cin>>N>>M>>K>>C>>A>>B>>T;
	cin>>bef;
	bef--;
	for(i=1;i<M;i++){
		cin>>it;
		it--;
		stenum=min((T-bef*A+C)/C,it-bef);
		ans+=max((llint)0,stenum);
		minit=bef*A;
		nokori=it-bef;
		kyu.push(mt(min((T-minit-stenum*B+C)/C,nokori-stenum),minit+stenum*B,nokori-stenum));
		
		//if(min((T-bef*A+C)/C,it-bef)<=0){printf("hsdlakj\n");}
		bef=it;
	}
	it=N;
	stenum=min((T-bef*A+C)/C,it-bef);
	ans+=max((llint)0,stenum);
	minit=bef*A;
	nokori=it-bef;
	kyu.push(mt(min((T-minit-stenum*B+C)/C,nokori-stenum),minit+stenum*B,nokori-stenum));
	//if(min((T-bef*A+C)/C,it-bef)<=0){printf("asaj\n");}
	K-=M;
	for(i=0;i<K;i++){
		stenum=get<0>(kyu.top());
		minit=get<1>(kyu.top());
		nokori=get<2>(kyu.top());
		kyu.pop();
		if(stenum<=0){break;}
		ans+=stenum;
		//if(ans==0){printf("de%d\n",i);}
		kyu.push(mt(min((T-minit-stenum*B+C)/C,nokori-stenum),minit+stenum*B,nokori-stenum));
		//if(min((T-minit-stenum*B+C)/C,nokori-stenum)<=0){printf("ko%d\n",i);}
	}
	cout<<ans-1<<endl;
}
```