#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

int N,M,K;
int A,B,C,T;

int S[3333];

signed main(){
    scanf("%lld%lld%lld",&N,&M,&K);
    scanf("%lld%lld%lld%lld",&A,&B,&C,&T);
    rep(i,M)scanf("%lld",&S[i]),S[i]--;
    S[M]=S[M-1]+1;
    vint v;
    int ans=0;
    rep(i,M){
        if(i*B>T)break;
        int t=0;
        for(int j=0;j<=K;j++){
            if(t==S[i+1]-S[i]||S[i]*B+t*C>T)break;
            int s=min(S[i+1]-S[i]-t,(T-S[i]*B-t*C)/A+1);
            if(j==0)ans+=s;
            else v.pb(s);
            t+=s;
        }
    }
    sort(all(v));reverse(all(v));
    for(int i=0;i<v.size()&&i<K-M;i++)ans+=v[i];
    cout<<ans-1<<endl;
    return 0;
}