#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 3e3 + 16;
const ll Log2 = 19;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
///Road to EF/M
set<ll> place;
struct point{
ll pot,pos,t;
};
bool operator < (point a,point b){
return a.pot < b.pot;
}
priority_queue<point> pq;
ll n,m,k,T,A,C,B,S[N],ans;
ll cur;
ll Cal_pot(ll pos,ll tg){
ll nxt = *place.upper_bound(pos); //cout<<nxt; exit(0);
ll inc = min(nxt - pos - 1,(T - tg)/A);
return inc + 1;
}
void out(priority_queue<point> p){
while(!p.empty()){
point now = p.top(); p.pop();
cout<<now.pot<<" "<<now.pos<<" "<<now.t<<"\n";
}
exit(0);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
#define task "tst"
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
//freopen(task".out", "w", stdout);
}
cin>>n>>m>>k>>A>>B>>C>>T; k -= m;
for (ll i = 1;i <= m;i++) cin>>S[i],place.insert(S[i]);
for (ll i = 1;i <= m;i++){
if (cur > T) break;
if (i == m){
ans++; break;
}
ll inc = min(S[i + 1] - S[i] - 1,(T - cur)/A);
//cout<<cur<<"\n"; //exit(0);
ans += inc + 1; inc++;
if (S[i] + inc< S[i + 1] && cur + C*inc <= T)
pq.push({Cal_pot(S[i] + inc,cur + C*inc),S[i] + inc,cur + C*inc});
cur += B*(S[i + 1] - S[i]);
}
ans--; //out(pq);
//cout<<ans; return 0;
while(k-- && !pq.empty()){
point now = pq.top(); pq.pop();
ans += now.pot; place.insert(now.pos);
ll nxt = *place.upper_bound(now.pos),cand = now.pos + now.pot,inc = now.pot;
if (cand < nxt && now.t + C*inc <= T)
pq.push({Cal_pot(cand,now.t + C*inc),cand,now.t + C*inc});
}
cout<<ans;
}
