#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int inf=1<<30;
double dp[150][150];
int p[150];
int min(int a,int b)
{if(a<b)return a;elsereturn b;
}
int main()
{int l,n,c,t,vr,v1,v2;double x,mm;while(scanf("%d",&l)!=EOF){scanf("%d%d%d",&n,&c,&t);scanf("%d%d%d",&vr,&v1,&v2);for(int i=1;i<=n;i++)scanf("%d",&p[i]);for(int i=0;i<=n+1;i++)for(int j=0;j<=n+1;j++)dp[i][j]=inf;p[n+1]=l;p[0]=0;dp[0][0]=0;for(int i=1;i<=n+1;i++){if(p[i]<c)dp[i][0]=1.0*p[i]/v1;else  dp[i][0]=1.0*c/v1+1.0*(p[i]-c)/v2;}for(int i=1;i<=n+1;i++)    //枚举末站点
        {for(int j=0;j<i;j++)   //枚举初站点
            {if(p[i]-p[j]<c)x=t+1.0*(p[i]-p[j])/v1;elsex=t+1.0*c/v1+1.0*(p[i]-p[j]-c)/v2;     //求出从j到i的时间for(int k=0;k<j;k++)dp[i][j]=min(dp[i][j],x+dp[j][k]);     }}mm=dp[n+1][0];for(int i=1;i<=n+1;i++)if(dp[n+1][i]<mm)mm=dp[n+1][i];if(mm<1.0*l/vr)printf("What a pity rabbit!\n");elseprintf("Good job,rabbit!\n");}
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
double dp[150];
int p[150];
int min(int a,int b)
{if(a<b)return a;elsereturn b;
}
int main()
{int l,n,c,t,vr,v1,v2;double x;while(scanf("%d",&l)!=EOF){scanf("%d%d%d",&n,&c,&t);scanf("%d%d%d",&vr,&v1,&v2);for(int i=1;i<=n;i++)scanf("%d",&p[i]);p[n+1]=l;p[0]=0;dp[0]=0;for(int i=1;i<=n+1;i++){if(p[i]<c)dp[i]=1.0*p[i]/v1;else  dp[i]=1.0*c/v1+1.0*(p[i]-c)/v2;}for(int i=1;i<=n+1;i++){for(int j=0;j<i;j++){if(p[i]-p[j]<c)x=t+1.0*(p[i]-p[j])/v1;elsex=t+1.0*c/v1+1.0*(p[i]-p[j]-c)/v2;dp[i]=min(dp[i],dp[j]+x);}}if(dp[n+1]<1.0*l/vr)printf("What a pity rabbit!\n");elseprintf("Good job,rabbit!\n");}
}
/*input:
100
3 20 5
5 8 2
10 40 60
100
3 60 5
5 8 2
10 40 60
output:
Good job,rabbit!
What a pity rabbit!
*/