//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include<bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define s second
#define f first
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
const int N = 5e6 + 1, mod = 998244353;
const ll inf = 1e18;
double eps = 1e-15;
bool flg = 0;
ll f(ll x, ll y, ll cur, ll t, ll a) {
ll v = (t - cur) / a;
v = min(y - 1, x + v);
return v - x + 1;
}
void slv() {
ll n, m, k;
cin >> n >> m >> k;
ll a, b, c;
cin >> a >> b >> c;
ll t, s[m + 2];
cin >> t;
for (int i = 1; i <= m; i++) cin >> s[i];
ll cur = 0, ans = -1;
s[m + 1] = n + 1;
set<array<ll, 4>> h;
for (int i = 1; i <= m; i++) {
if (i > 1) cur += (s[i] - s[i - 1]) * b;
h.insert({inf, s[i], s[i + 1], cur});
}
while (k-- && sz(h)) {
auto [v, x, y, ct] = (*--h.end());
h.erase(--h.end());
bool is = 1;
if (ct > t) v = 0;
else v = f(x, y, ct, t, a);
ans += v;
x += v;
ct += c * v;
if (ct > t || x == y) continue;
h.insert({f(x, y, ct, t, a), x, y, ct});
}
cout << ans;
}
main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
int tp = 1;
if (flg) cin >> tp;
while (tp--) {
slv();
}
}
//wenomechainsama
