#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
#define inf 1e20
#define eps 1e-8

enum state {
  roaming,
  waiting,
  carrying,
  ending,
};
struct elev_t {
  int cap,stop,dest;
  double v;
  int carry;
  state status;

  double level;
  double next_time;
} es[20];

int n,m;
double d;
int ns[40];
double fire[40];

int main()
{
  while(scanf("%d%d",&n,&m)&&n|m) {
    memset(es,0,sizeof(es));
    memset(ns,0,sizeof(ns));
    scanf("%lf",&d);
    for (int i=0;i<n;++i) scanf("%d",ns+i);
    for (int i=0;i<m;++i) {
      scanf("%d%lf%d%d",&es[i].cap,&es[i].v,&es[i].stop,&es[i].dest);
      --es[i].dest;
      es[i].level=(double)es[i].dest;
      es[i].next_time=0;
      es[i].status=roaming;
    }
    int kk,tx,ty,tz;
    scanf("%d%d%d%d",&kk,&tx,&ty,&tz);
    --kk;
    for (int i=0;i<n;++i) {
      if (i==kk) fire[i]=tx;
      else if (i>kk) fire[i]=tx+ty*(i-kk);
      else if (i<kk) fire[i]=tx+tz*(kk-i);
    }
    int flag=0;
    int carry_total=ns[0];
    ns[0]=0;

    double t=0;
    double ans_time=0;

    while(1) {
      //      puts("----");
      int index=-1;

      int dest=-1;
      for (int i=n-1;i>=0;--i) 
	if (ns[i]>0) {
	  dest=i;
	  break;
	}
      if (dest==-1) {
	for (int i=0;i<m;++i)
	  if (es[i].status==roaming&&es[i].carry==0) 
	    es[i].status=ending;
	int flag=0;
	for (int i=0;i<m;++i)
	  if (es[i].status!=ending) {
	    flag=1;
	    break;
	  }
	if (!flag) break;
      }

      for (int i=0;i<m;++i) {
	if (es[i].status==roaming) {
	  if (dest==-1) {
	    es[i].status=carrying;
	    es[i].dest=0;
	  } else {
	    es[i].dest=dest;
	  }
	  es[i].next_time=t;
	  es[i].next_time+=abs(es[i].dest-es[i].level)*d/es[i].v;
	} else if (es[i].status==carrying) {
	  es[i].dest=0;
	  es[i].next_time=t+abs(0.0-es[i].level)*d/es[i].v;
	} else if (es[i].status==ending) {
	  es[i].dest=-1;
	  es[i].next_time=inf;
	}
      }

      double nt=inf;
      for (int i=0;i<m;++i) {
	if (es[i].next_time<nt) {
	  nt=es[i].next_time;
	  index=i;
	}
      }
      for (int i=0;i<n;++i) {
	if (t+eps<fire[i]&&fire[i]<nt+eps) {
	  nt=fire[i];
	  index=i+m;
	}
      }

      for (int i=0;i<m;++i) {
	if (es[i].status==roaming||es[i].status==carrying) {
	  if ((double)es[i].dest>es[i].level)
	    es[i].level+=(double)(nt-t)*es[i].v/d;
	  else
	    es[i].level-=(double)(nt-t)*es[i].v/d;
	}
      }
      
      if (index>=m) {
	//	printf("%.3lf: fire %d\n",nt,index-m);
	ns[index-m]=0;
      } else {
	if (es[index].status==waiting) {
	  //	  printf("%.3lf: departure %d %d %d\n",nt,index,(int)(es[index].level+0.5),es[index].carry);
	  if (es[index].carry==es[index].cap||dest==-1) {
	    if (es[index].carry>0) es[index].status=carrying;
	    else es[index].status=ending;
	  } else {
	    es[index].status=roaming;
	  }
	} else if (es[index].status==carrying) {
	  //	  printf("%.3lf: carried %d %d %d\n",nt,index,(int)(es[index].level+0.5),es[index].carry);
	  if (es[index].carry>0) ans_time=max(ans_time,nt+es[index].stop);
	  carry_total+=es[index].carry;
	  es[index].carry=0;
	  es[index].status=waiting;
	  es[index].next_time+=es[index].stop;
	} else if (es[index].status==roaming) {
	  //	  printf("%.3lf: apparture %d %d %d\n",nt,index,(int)(es[index].level+0.5),es[index].carry);
	  
	  int pos=es[index].dest;
	  int k=min(ns[pos],es[index].cap-es[index].carry);
	  es[index].carry+=k;
	  ns[pos]-=k;
	  if (pos>0) flag=1;
	  
	  es[index].status=waiting;
	  es[index].next_time+=es[index].stop;

	  //	  printf("%.3lf: apparture %d %d %d\n",nt,index,(int)(es[index].level+0.5),es[index].carry);
	}
      }

      t=nt;
    }
    
    if (!flag) ans_time=0;
    printf("%d %.6lf\n",carry_total,ans_time);
  }
}