#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <cmath>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define INF 1<<30
#define EPS 1e-8
#define mp make_pair
#define equals(a,b) fabs((a) - (b)) < EPS

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
	int n, k, l;
	double t, u, v;
	cin >> n >> k >> t >> u >> v >> l;

	bool d[100005];
	memset(d, 0, sizeof(d));

	rep(i, n) {
		int x;
		cin >> x;
		d[x] = true;
	}

	double ans = 0;
	double time = 0.0;
	int cnt = 0;

	rep(i, l) {
		if(d[i]) {
			if(cnt == k) time = t;
			else cnt++;
		}

		if(equals(time, 0.0)) {
			if(cnt > 0) {
				time = t;
				cnt--;
			}
		}

		if(time > EPS) {
			ans += 1.0 / v;
			time -= 1.0 / v;
		} else {
			ans += 1.0 / u;
		}
	}

	cout << fixed;
	cout.precision(20);
	cout << ans << endl;

	return 0;
}