#include <bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define bit(s,i) (((s)>>(i))&1)
#define all(a) (a).begin(),(a).end()
#define sz(a) (int)(a).size()
#define ii pair<int,int>
#define fi first
#define se second
#define int long long
#define eb emplace_back
#define pb push_back
#define ll long long
#define __builtin_popcount(a) __builtin_popcountll(a)
template <class X, class Y>
bool maxi(X &x, Y y){
if(x<y){
x=y;
return true;
}
return false;
}
template <class X, class Y>
bool mini(X &x, Y y){
if(x>y){
x=y;
return true;
}
return false;
}
const int N=3030;
int n,m,k,a,b,c,s[N]; ll t;
int calc(int i, int num){
ll tim=(s[i]-1)*b;
if(tim+num*c>t) return 0;
return min(s[i+1]-s[i]-num, (t-tim-num*c)/a + 1);
}
void solve(){
cin>>n>>m>>k>>a>>b>>c>>t;
foru(i,1,m) cin>>s[i];
int res=0;
priority_queue<pair<int,ii>> pq;
k-=m;
s[m+1]=n+1;
foru(i,1,m){
ll tim=1LL*(s[i]-1)*b;
if(tim>t) continue;
int add=min(s[i+1]-s[i], (t-tim)/a + 1);
res+=add;
pq.push({calc(i,add),{i,add}});
}
while(pq.size() && k>0){
int add=pq.top().fi,
i=pq.top().se.fi,
j=pq.top().se.se;
pq.pop();
res+=add; --k;
j+=add;
pq.push({calc(i,j),{i,j}});
}
cout<<res-1<<'\n';
}
int32_t main(){
#define task "test"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin.tie(0)->sync_with_stdio(0);
solve();
}
