#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 3005
#define mod 998244353

int n, m, k;
ll a, b, c, T;
ll s[maxn];
priority_queue<ll> pq;

int main()
{
    cin >> n >> m >> k >> a >> b >> c >> T;
    ll ans = 0;
    for (int i = 1; i <= m; i++)
    {
        scanf("%lld", &s[i]);
        s[i]--;
    }
    for (int i = 1; i <= m - 1; i++)
    {
        ll tl = s[i] * b;
        if (tl > T)
            continue;
        ll add = (T - tl) / a;
        ans += min(s[i] + add, s[i + 1] - 1) - (s[i] - 1);
        ll now = s[i] + add + 1;
        for (int j = 0; j < k - m; j++)
        {
            if (now >= s[i + 1])
                break;
            tl = s[i] * b + (now - s[i]) * c;
            if (tl > T)
                break;
            add = (T - tl) / a;
            ll r = min(s[i + 1] - 1, now + add);
            pq.push(r - now + 1);
            now = r + 1;
        }
    }
    if ((n - 1) * b <= T)
        ans++;
    int left = k - m;
    while (!pq.empty() && left--)
    {
        ans += pq.top();
        pq.pop();
    }
    printf("%lld\n", ans - 1);
    return 0;
}

