#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=1e3+100,L=21,bs=701,NN=1e6;
ll b,c,a,t,s[N],n,m,k,ans=-1;
int main(){
fast_io
cin>>n>>m>>k;
cin>>a>>b>>c;
cin>>t;
for1(m)cin>>s[i];
vector<pll>vec;
vector<ll>vec2;
k-=m;
s[m+1]=n+1;
for1(m){
if(t<0)break;
ll l=s[i]+t/a;
l=min(l,s[i+1]-1);
ans+=l+1-s[i];
ll tt=t-c*(l+1-s[i]);
for(int j=1;j<=k;j++){
if(tt<0)break;
ll d=min(tt/a+1,s[i+1]-1-l);
vec2.pb(d);
tt-=d*c;
l+=d;
}
t-=(s[i+1]-s[i])*b;
}
sort(all(vec2),greater<ll>());
for0(min(k,ll(vec2.size())))ans+=vec2[i];
cout<<ans<<endl;
}
