#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = (1LL << 60) - 1;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
#define MAX_N 100100 * 3

int n, k, t, u, v, l;
bool pos[100100];
double dv[100100];

int main() {
	cin >> n >> k >> t >> u >> v >> l;
	rep(i, n) {
		int num;
		cin >> num;
		pos[num] = 1;
	}
	int w = 0;
	int cnt = 0;
	bool f = 0;
	rep(i, l) {
		if (!f) {
			if (pos[i]) {
				f = 1;
				w = t*v - 1;
			}
		}
		else {
			if (pos[i]) {
				if (cnt < k)cnt++;
				else w = t*v;
			}
			if (w > 0)w--;
			else {
				if (cnt > 0) {
					cnt--;
					w = t*v - 1;
				}
				else f = 0;
			}
		}
		if (f)dv[i] = v;
		else dv[i] = u;
	}
	double ans = 0;
	rep(i, l) {
		//cout << i << " " << dv[i] << endl;
		ans += (1.0 / dv[i]);
	}
	printf("%.10lf\n", ans);
}