#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

#define dump(a) (cerr << (#a) << " = " << (a) << endl)
#define FOR(it,c) for(__typeof((c).begin())it=(c).begin(); it!=(c).end();++it)
#define RFOR(it,c) for(__typeof((c).rbegin())it=(c).rbegin(); it!=(c).rend();++it)
#define exist(c, v) (find((c).begin(), (c).end(), (v)) != (c).end())

template<class T> inline void chmax(T& a, const T& b) { if(b > a) a = b; }
template<class T> inline void chmin(T& a, const T& b) { if(b < a) a = b; }

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os << '(' << p.first << ", " << p.second << ')';
	return os;
}

template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
	copy(v.begin(), v.end(), ostream_iterator<T>(os, " "));
	return os;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n, k, t, u, v, l;
	scanf("%d %d %d %d %d %d", &n, &k, &t, &u, &v, &l);

	vector<bool> carrot(l, false);
	for(int i = 0; i < n; ++i) {
		int d;
		scanf("%d", &d);
		carrot[d] = true;
	}

	int cnt = 0, num = 0, rest = 0;
	for(int i = 0; i < l; ++i) {
		if(carrot[i])
			++num;

		if((num && !rest) || num > k) {
			rest = t * v;
			--num;
		}

		if(rest) {
			--rest;
			++cnt;
		}
	}

	printf("%.15lf\n", (double)cnt / v + (double)(l - cnt) / u);

	return EXIT_SUCCESS;
}