#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
void main(){
int l, n, c, t, vr, vt1, vt2,a[110];
double dp[110];//记录到第i个电站的最短时间
double time = 0.0;
while (~scanf("%d", &l))
{
scanf("%d %d %d %d %d %d", &n, &c, &t, &vr, &vt1, &vt2);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
a[0] = 0;//起点
a[n + 1] = l;//终点
dp[0] = 0;
for (int i = 1; i < n+2; i++)
{
dp[i] = 10000000;
for (int j = 0; j < i; j++)
{
if (a[i] - a[j]>c) //如果第j到第i个电站的距离比续航距离大
time = 1.0*c / vt1 + 1.0*(a[i] - a[j] - c) / vt2;
else
time = 1.0*(a[i] - a[j]) / vt1;
dp[i] = min(dp[i], dp[j] + time + t*(j>0));//加上到电站j的最短时间和充电时间
}
}
time = 1.0*l / vr;
if (time > dp[n + 1])
printf("What a pity rabbit!\n");
else printf("Good job,rabbit!\n");
}
}