#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;
const int Max = 1e6 + 7, Inf = 1e15 + 7;
void print(bool x) { cout << (x ? "YES" : "NO") << endl; }
string tostring (__int128 x)
{
string ans = "";
while(x > 0)
{
ans += (x % 10 + '0');
x /= 10;
}
reverse(all(ans));
return ans;
}
void solve()
{
int n, m, k; cin >> n >> m >> k;
int a, b, c; cin >> a >> b >> c;
int t; cin >> t;
vector <int> v(m), p(m);
for(auto& u : v) cin >> u;
k -= m; v.push_back(n+1);
int ans = -1;
for(int i = 0; i < m; i++)
{
int x = (v[i] - 1) * b;
ans += min(max(0LL, (t - x) / a), v[i+1] - v[i] - 1);
p[i] = v[i] + (t - x) / a + 1;
ans += (x <= t);
}
for(int i = 0; i < k; i++)
{
pair <int, int> px = { 0, 0 };
for(int j = 0; j < m; j++) if(p[j] < v[j+1])
{
int x = (v[j] - 1) * b + (p[j] - v[j]) * c;
int cont = min(max(0LL, (t - x) / a), v[j+1] - p[j] - 1) + long(x <= t);// cout << i << " " << cont << " " << p[j] << " " << v[j+1] << endl; ;
if(px.sd < cont)
{
px = { j, cont };
}
}
if(px.sd == 0) break;
ans += px.sd;
p[px.fs] += px.sd;
}
cout << ans << endl;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int Q = 1; //cin >> Q;
while (Q--)
{
solve();
}
return 0;
}
