//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("unroll-all-loops")
#include <bits/stdc++.h>
//#define TASK "lca"
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define pb push_back
#define int long long
#define pii pair<int, int>
#define len(x) (long long)x.size()
typedef long long ll;
//typedef long double ld;
using namespace std;
const int INF = 1e18;
const int MAXN = 1e8;
const int MOD = 1e9 + 7;
const double EPS = 1e-12;
const vector<int> dx = {1, 0, -1, 0, 0, 1, 0, -1};
//char buf[(int)1e9];
//size_t p_ = 0;
//
//inline void *operator new(size_t n_) {
// p_ += n_;
// return buf + p_ - n_;
//}
//inline void operator delete(void*) {};
ll power(ll x, ll n, ll mod = 1e9 + 7) {
if (n == 0) return 1ll;
if (n & 1ll) return power(x, n - 1ll, mod) * x % mod;
ll tmp = power(x, n >> 1ll, mod);
return (tmp * tmp) % mod;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd (b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
set<int> semiexpress;
set<pii, greater<pii>> active;
int A, B, C, T;
int n, m, k;
int MAX_SZ = 0;
int try_add(int l, int r) {
int num = 0;
int t = l * B;
int cur_pos = l;
while (cur_pos < r) {
if (t > T) break;
int cnt = (T - t) / A;
int next = min(cur_pos + cnt + 1, r);
if (cur_pos == l) num = next - l;
else active.insert({next - cur_pos, cur_pos});
t += (next - cur_pos) * C;
cur_pos = next;
if (len(active) > MAX_SZ) break;
}
return num;
}
signed main() {
#ifndef LOCAL
#ifdef TASK
freopen(TASK".in", "r", stdin);
freopen(TASK".out", "w", stdout);
#endif
#endif
#ifdef LOCAL
//freopen("/Users/alekseygolub/Desktop/с++/ABS/ABS/input.txt", "r", stdin);
#endif
iostream::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
srand(924653523);
// == SOLUTION == //
cin >> n >> m >> k;
cin >> A >> B >> C >> T;
MAX_SZ = k + 10;
vector<int> s(m);
for (auto &in: s) { cin >> in; in--; }
int ans = 0;
if (s[m - 1] * B <= T) ans = 1;
for (int i = 0; i < len(s) - 1; i++) {
ans += try_add(s[i], s[i + 1]);
if (len(active) > MAX_SZ) break;
}
k -= m;
for (auto x: active) {
if (k == 0) break;
ans += x.F;
k--;
}
cout << ans - 1 << "\n";
}
