#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e3 + 5;

const int oo = 1e18 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

int n, m, k;
int a, b, c;
int t;
int arr[N];

int cal[N][N];

void process(){
	cin >> n >> m >> k;
	cin >> a >> b >> c;
	cin >> t;
	for(int i = 1; i <= m; i++) cin >> arr[i];
	sort(arr + 1, arr + m + 1);
	k -= m;
	arr[m + 1] = n + 1;
	for(int i = 1; i <= m; i++){
		int val = (t - b * (arr[i] - 1));
	//	cout << i << " " << val << "\n";
		if(val < 0) break;
		int diff = arr[i + 1] - arr[i];
		//cout << "OK " << i << " " << val << " " << diff << "\n";
		if(((diff - 1) * a) <= val){
			cal[i][0] = diff;
			continue;
		} 
		else cal[i][0] = (val / a) + 1;
		int lst = arr[i] + (val / a);
		for(int j = 1; j <= k; j++){
			//val ;
			int val2 = val - ((lst + 1 - arr[i]) * c);
		//	cout << i << " " << j << " " << val2 << "\n";
			//val = ( + l)
			if(val2 < 0) break;
			int nxt = min(arr[i + 1] - 1, lst + 1 + val2 / a);
			cal[i][j] = nxt - lst;
			if(nxt == arr[i + 1] - 1) break;
			lst = nxt;
		}
	}
	/*
	for(int i = 1; i <= m; i++){
		for(int j = 0; j <= k; j++) cout << i << " " << j << " " << cal[i][j] << "\n";
	}*/
	//exit(0);
	vector<int> cnt(m + 1);
	priority_queue<ii, vector<ii>> pq;
	int answer = 0;
	for(int i = 1; i <= m; i++) answer += cal[i][0];
	for(int i = 1; i <= m; i++) cnt[i] = 1;
	for(int i = 1; i <= m; i++) pq.push({cal[i][1], i});
	for(int i = 1; i <= k; i++){
		if(pq.empty()) break;
		ii temp = pq.top();
		pq.pop();
		answer += temp.fi;
		cnt[temp.se]++;
		if(cnt[temp.se] <= k) pq.push({cal[temp.se][cnt[temp.se]], temp.se});
	}
	cout << answer - 1 << "\n";
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
}