#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif
#define LDcout(x,n) fixed<<setprecision(n)<<x

#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
struct kanmon{
	double x;
	double L,F,D;
	int UD;
	double up,down;
};
void mainmain(){
	int n,m,K;

	while(cin>>n>>m>>K,n||m||K){
		vector<kanmon> v(n);
		vint pos(K+300,-1);
		rep(i,n){
			cin>>v[i].x>>v[i].L>>v[i].F>>v[i].D>>v[i].UD;
			v[i].up=v[i].L/v[i].F;
			v[i].down=v[i].L/v[i].D;
			pos[v[i].x+150]=i;
		}
		vector<double> w(m);
		rep(i,m) cin>>w[i];
		vector<VV(double)> dp;
		initvv(dp,m,K+300,vector<double>(2,0));
		rep(i,m){
			dp[i][-i+150][0]=dp[i][-i+150][1]=0;
		}
		rep(i,m){
			reep(j,-i+150+1,K+(m-1-i)+150+1){
				if(!i){
					if(pos[j]==-1){
						dp[i][j][0]=dp[i][j][1]=dp[i][j-1][1]+1.0/w[i];
					}
					else{
						int p=pos[j];
						dp[i][j][0]=dp[i][j-1][1]+1.0/w[i];
						if(v[p].UD){
							dp[i][j][0]=max(dp[i][j][0],v[p].up);
						}
						dp[i][j][1]=dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down);
					}
				}
				else{
					if(pos[j]==-1){
						dp[i][j][0]=dp[i][j][1]=max(dp[i][j-1][1]+1.0/w[i],dp[i-1][j+1][0]);
					}
					else{
						int p=pos[j];
						dp[i][j][0]=dp[i][j-1][1]+1.0/w[i];
						dp[i][j][0]=max(dp[i][j][0],max(dp[i-1][j+1][0],dp[i-1][j][1]+(v[p].UD?v[p].up:v[p].down)));
						dp[i][j][1]=max(dp[i][j][0]+(v[p].UD==0?v[p].up:v[p].down),dp[i-1][j+1][0]);
					}
				}
				// cout<<i<<" "<<j-150<<" "<<dp[i][j][0]<<endl;
			}
			// cout<<endl;
		}
		cout<<dp[m-1][K+150][0]<<endl;
		// rep(i,n){
		// 	double t;
		// 	if(i){
		// 		t=max((v[i].x-v[i-1].x)/w[0],(v[i].UD==0)?0.0:v[i].up)+dp[0][i];
		// 	}
		// 	else{
		// 		t=max(v[i].x/w[0],(v[i].UD==0)?v[i].down:v[i].up);
		// 	}
		// 	dp[0][i+1]=t+(v[i].UD==0?v[i].up:v[i].down);
			// cout<<i<<" "<<dp[0][i+1]<<endl;
		// }
		// dp[0][n+1]=dp[0][n]+(K-v[n-1].x)/w[0];
		// reep(i,1,m){
		// 	rep(j,n){
		// 		double t1;
		// 		if(j){
		// 			t1=(v[j].x-v[j-1].x)/w[i];
		// 		}
		// 		else{
		// 			t1=v[j].x/w[i];
		// 		}
		// 		t1=max(t1,dp[i-1][j]);
		// 	}
		// }
	}
}


signed main() {
	ios_base::sync_with_stdio(false);
  	cout<<fixed<<setprecision(10);
    mainmain();
}