#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#define LL long long
#define FORa(i,s,e) for(LL i=s;i<=e;i++)
#define FORs(i,s,e) for(LL i=s;i>=e;i--)
#define gc pa==pb&&(pb=(pa=buf)+fread(buf,1,10000,stdin),pa==pb)?EOF:*pa++
#define File(name) freopen(name".in","r",stdin),freopen(name".out","w",stdout)using namespace std;
static char buf[10000],*pa=buf,*pb=buf;
inline LL read();LL K,L;
bool Prime(int x)
{FORa(i,2,sqrt(x))if(x%i==0)return 0;return 1;
}
void Solve()
{FORa(i,2,L-1){if(Prime(i)&&Prime(K/i)&&K%i==0){printf("BAD %d\n",i);return; }}printf("GOOD\n");
}
int main()
{File("crypto");K=read(),L=read();while(K!=0&&L!=0){Solve();K=read(),L=read();}return 0;
}
inline LL read()
{register LL x(0);register LL f(1);register char c(gc);while(c<'0'||c>'9') f=c=='-'?-1:1,c=gc;while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=gc;return x*f;
}

#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<cstring>
#define LL long long
#define FORa(i,s,e) for(LL i=s;i<=e;i++)
#define FORs(i,s,e) for(LL i=s;i>=e;i--)
#define File(name) freopen(name".in","r",stdin);freopen(name".out","w",stdout);const int N=1000000;
int cnt,prime[N+1],v[N+1];
string K;
LL L;
void Prime()
{FORa(i,2,L){if(!v[i]) v[i]=prime[++cnt]=i;FORa(j,1,cnt){if(prime[j]>j|prime[j]*i>L) break;v[prime[j]*i]=prime[j];}}
}
bool Check(int x)
{int f=1;while(1);
}
void Solve()
{FORa(i,1,cnt){if(Check(i)){printf("BAD %d\n",i);return; }}printf("GOOD\n");
}
int main()
{File("crypto");while(K!="0"&&L!=0){Prime(),Solve();cin>>K;scanf("%d",&L);}return 0;
}