#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

ll N, M, K;
ll A, B, C;
ll T;
vector<ll> S;
map<ll,ll, greater<ll> > cnt;
ll ans;


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> N >> M >> K;
	cin >> A >> B >> C;
	cin >> T;

	ans = 0;

	for (int i = 0;i < M;i++){
		ll tmp; cin >> tmp;
		S.push_back(tmp);
	}

	for (int i = 1;i < M;i++){
		ll time = (S[i-1]-1)*B;
		ll sta = (T-time)/A + 1 + S[i-1];
		if(sta >= S[i]) sta = S[i];
		if(T >= time )ans += sta-S[i-1];
		else break;
		ll tmp = 0;
	   while(sta < S[i] && tmp <= K-M){
			ll rem = T - time - (sta-S[i-1])*C;
	   		ll num = rem / A + 1;
			if(rem < 0) break;
			sta += num;
			if(sta-1 >= S[i]) cnt[num-(sta-S[i])]++;
			else cnt[num]++;
			tmp++;
	   }	
	}

	if((N-1)*B <= T) ans++;
	ans--;

	K -= M;

	for(auto& i: cnt){
		if(K-i.second <= 0){ 
			ans += i.first*K;
		   	break;
		} else {
			ans += i.second*i.first;
			K -= i.second;
		}
	}

	cout << ans << endl;

	return 0;

}

