#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char>
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
const ll inf = (1ll<<60);
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=2005;
const double PI=acos(-1);
ll pw(ll x, ll p, ll m=mod){
ll ret=1;
while (p>0){
if (p&1){
ret*=x;
ret%=m;
}
x*=x;
x%=m;
p>>=1;
}
return ret;
}
ll inv(ll a, ll m=mod){
return pw(a,m-2);
}
signed main(){
IOS();
int n,m,o; cin>>n>>m>>o;
int a,b,c; cin>>a>>b>>c;
int t; cin>>t;
vector<int> occ(n+1);
REP(i,m){
int x; cin>>x;
occ[x]=1;
}
int ans=0;
vector<int> dp(n+1);
REP1(i,n){
FOR(j, i+1, n+1){
REP1(k,n) dp[k]=0;
int lc=1, lb=1;
int cnt=0;
REP1(k,n){
if (k==1) continue;
dp[k]=dp[k-1]+a;
if (occ[k]){
dp[k]=min(dp[k], dp[lb]+b*(k-lb));
lb=k;
}
if (k==i||k==j||occ[k]){
dp[k]=min(dp[k], dp[lc]+c*(k-lc));
lc=k;
}
if (dp[k]<=t){
cnt++;
}
}
ans=max(ans, cnt);
}
}
cout<<ans<<endl;
}
