#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int N = 3e3L + 11;

int s[N];

int main() {
	ios :: sync_with_stdio(false);
	int n, m, k; cin >> n >> m >> k;
	ll a, b, c; cin >> a >> b >> c;
	ll t; cin >> t;
	for(int i = 1; i <= m; i ++)
		cin >> s[i];
	s[m + 1] = n + 1;
	int ans = -1;
	vector <int> v(N, 0);
	for(int i = 1; i <= m; i ++)
		if((s[i] - 1) * b <= t) {
			ans ++;
			int x = s[i + 1] - s[i] - 1;
			ll r = (t - (s[i] - 1) * b) / a;
			if(r >= x)
				ans += x;
			else {
				ans += r;
				for(int _ = 0; _ < N && r < x; _ ++) {
					ll nt = t - (s[i] - 1) * b - (r + 1) * c;
					if(nt >= 0) {
						v.push_back(min(nt / a + 1, x - r));
						r += nt / a + 1;
					} else
						break;
				}
			}
		}
	sort(v.begin(), v.end(), greater<int>());
	for(int i = 0; i < k - m; i ++)
		ans += v[i];
	cout << ans << '\n';
	return 0;
}