# Hdu 2059 龟兔赛跑

http://acm.hdu.edu.cn/showproblem.php?pid=2059

double temp = T / ((double)1 / VT2 - (double)1 / VT1);

#include<iostream>
using namespace std;
struct box
{
int p;
double time;
}dp[101];
int L, N, C, T, VR, VT1, VT2;
double time1, time2;
void find(){
for (int i = 1; i <= N + 1; i++){
if (dp[i].p <= C){
dp[i].time = (double)dp[i].p / VT1;
continue;
}
else dp[i].time = (double)C / VT1 + (double)(dp[i].p - C) / VT2;
for (int j = 1; j < i; j++){
double temp = T / ((double)1 / VT2 - (double)1 / VT1);
double temp2 = dp[i].p - dp[j].p;
if (temp2>C){
time2 =T+ dp[j].time + (double)C / VT1 + (double)(temp2 - C) / VT2;
}
else if (temp2<temp)
{
time2 = dp[j].time + (double)temp2 / VT2;
}
else
{
time2 = dp[j].time + T + (double)temp2 / VT1;
}
if (time2 < dp[i].time) dp[i].time = time2;
}
}
}
int main(){
while (cin>>L)
{
cin >> N >> C >> T >> VR >> VT1 >> VT2;
for (int i = 1; i <= N; i++){
cin >> dp[i].p;
dp[i].time = 0;
}
dp[0].p = dp[0].time = dp[N + 1].time = 0;
dp[N + 1].p = L;
find();
time1 = (double)L / VR;
if (dp[N + 1].time < time1) cout << "What a pity rabbit!" << endl;
else cout << "Good job,rabbit!" << endl;
}
return 0;
}