# hdu 2059 龟兔赛跑 水题

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <sstream>
#include <ostream>
#include <list>
#include <ctype.h>
#include <cmath>
#define inf 2000000007
using namespace std;
double arr[300];
int s[300];
double min(double a,double b)
{
if(a<b) return a;
return b;
}
int main()
{
double len;
while(scanf("%lf",&len)!=EOF)
{
memset(arr,0,sizeof(arr));
memset(s,0,sizeof(s));
int n,c;
double t;
double vr,vt1,vt2;
cin>>n>>c>>t>>vr>>vt1>>vt2;
for(int i=1;i<=n;i++)
cin>>s[i];
s[n+1]=len;arr[0]=0;
for(int i=1;i<=n+1;i++)
{
arr[i]=inf;
for(int j=0;j<i;j++)
{
int lenth=s[i]-s[j];
double time1=lenth*1.0/vt2;
double time2=0;
if(j) time2+=t;
if(c>=lenth) time2+=lenth*1.0/vt1;
else time2+=c/vt1+(lenth-c)/vt2;
double time=min(time1,time2);//这个地方的 time要用double 错了好几次才看出来;
arr[i]=min(arr[i],arr[j]+time);
}
}
//cout<<arr[n+1]<<endl;
if(arr[n+1]<(double)len/vr) cout<<"What a pity rabbit!"<<endl;
else cout<<"Good job,rabbit!"<<endl;
}
return 0;
}