Python Code
t=int(input())
for _ in range(t):
c,n,k=map(int,input().split())
l=[]
for i in range(n):
l.append(list(map(int,input().split())))
l.sort()
if k==0:
m=0
for i in range(n-1):
if l[i][1]<l[i+1][0]:
continue
else:
m=1
break
if m==1:
print('Bad')
else:
print('Good')
else:
g=-1
m=0
for i in range(n-1):
if l[i][1]>=l[i+1][0]:
m+=1
if g==-1:
g=i
if m>1:
print('Bad')
elif m==0:
print('Good')
else:
cake=min(l[g][1]-l[g][0]+1,l[g+1][1]-l[g+1][0]+1)
u=0
for j in range(n-1):
if j!=g and (l[j+1][0]-l[j][1]-1>=cake):
u=1
break
if c-l[-1][1]>=cake:
u=1
if l[0][0]-1>=cake:
u=1
if u==1:
print('Good')
else:
print('Bad')