Problem:
 Score: 100 points    Problem Statement  Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K , while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print OK ; if he cannot, print NG .      Constraints   All values in input are integers.  1 \leq A \leq B \leq 1000  1 \leq K \leq 1000         Input  Input is given from Standard Input in the following format:  K  A  B       Output  If he can achieve the objective, print OK ; if he cannot, print NG .        Sample Input 1 7
500 600      Sample Output 1 OK  Among the multiples of 7 , for example, 567 lies between 500 and 600 .       Sample Input 2 4
5 7      Sample Output 2 NG  No multiple of 4 lies between 5 and 7 .       Sample Input 3 1
11 11      Sample Output 3 OK

Solution (Python):
k = int(input())
a,b = map(int,input().split())
m = k
while True:
  if a <= m <= b:
    print("OK")
    break
  m += k
  if m >= 1000:
    print("NG")
    break

Solution (Python):
k = int(input())
a,b = map(int,input().split())

for i in range(b//k+1):
  if i*k >= a and i*k <= b:
    print("OK")
    exit()
print("NG")

Solution (Python):
k = int(input())
a, b = map(int, input().split())

x = 0

for i in range(1, 1001):
    if a <= k*i <= b:
        x = 1
        break

if x == 1:
    print("OK")
else :
    print("NG")

Solution (Python):
import sys
k=int(input())
a, b=map(int,input().split())
for i in range(a, b+1):
  if i%k==0:
    print("OK")
    sys.exit()
print("NG")

Solution (Python):
k=int(input())
a,b=map(int,input().split())
x=b//k
if ((x*k) >= a) and ((x*k) <= b):
    print('OK')
else:
    print('NG')

Solution (Python):
K = int(input())
A , B = map(int, input().split())
C = False
for i in range(A,B+1):
  if i % K == 0:
    C = True
if C == True:
  print("OK")
else:
  print("NG")

Solution (Python):
k = int(input())
a, b = map(int, input().split())
ans = 0
for i in range(a, b+1):
  if i % k == 0:
    ans = 1
if ans == 1:
 	 print("OK")
else:
  	print("NG")

Solution (Python):
K = int(input())
a,b=map(int, input().split())

f = 0
for i in range(a, b+1):
    if ((i)%K ==0):
        f = 1

if f:
    print("OK")
else:
    print("NG")

Solution (Python):
k = int(input())
a, b = map(int, input().split());

x = 0;
for i in range(a,b+1):
    if i % k == 0:
        x += 1;

if x == 0:
    print('NG')
else:
    print('OK')

Solution (Python):
k = int(input())
a,b = map(int, input().split())

if a <= k * int(b/k):
    print("OK")
else:
    print("NG")

Solution (Python):
k=int(input())
a,b=map(int,input().split())
ob="NG"
for i in range(a,b+1):
  if i%k==0:
    ob="OK"
print(ob)

Solution (Python):
a = int(input())

low, hi = map(int, input().split())

start = a * int(low//a)

boolean = False

while not (start > hi):
  if low <= start <= hi: 
    boolean = True
    break
  start += a

if boolean: print("OK")
else: print("NG")

Solution (Python):
K = int(input())
A,B = map(int, input().split())

print("ONKG"[B%K>B-A::2])

Solution (Python):
def main():
    import sys
    read = sys.stdin.buffer.read
    readline = sys.stdin.buffer.readline
    readlines = sys.stdin.buffer.readlines
    sys.setrecursionlimit(10 ** 7)

    k = int(readline())
    a, b = map(int, readline().split())
    for i in range(a, b + 1):
        if i % k == 0:
            print('OK')
            break
    else:
        print('NG')


if __name__ == '__main__':
    main()

Solution (Python):
k = int(input())
a, b = map(int,input().split())

if b//k*k >= a:
  print("OK")
else:
  print("NG")

Solution (Python):
K = int(input())
A, B  = map(int, input().split())
X = B//K - A//K

if B%K == 0 or A%K == 0:
    print("OK")

elif X == 0 :
    print("NG")

else :
    print("OK")

Solution (Python):
K,A,B = map(int,open(0).read().split())
a = "NG"

for N in range(A,B+1):
  if N%K==0:
    a = "OK"

print(a)

Solution (Python):
K = int(input())
A, B  = map(int, input().split())
C = B//K - A//K

if B%K == 0 or A%K == 0:
    print("OK")

elif C == 0 :
    print("NG")

else :
    print("OK")

Solution (Python):
K = int(input())
A,B = map(int,input().split())

ans = 0
ng = 0
for i in range(A,B+1):
    if i % K == 0:
        print("OK")
        break
else:
    print("NG")

Solution (Python):
K = int(input())
A = list(map(int, input().split()))
if A[1]//K!=A[0]//K or A[1]%K==0 or A[0]%K==0:
    print("OK")
else:
    print("NG")

Solution (Python):
def main():
  x = int(input())
  a, b = map(int, input().split())
  
  for i in range(a, b+1):
    if i % x == 0:
      print('OK')
      return
  
  print('NG')
    
      
  
main()

Solution (Python):
K = int(input())
A, B = map(int, input().split())

min_num = A//K
max_num = B//K

for i in range(min_num, max_num+1):
  if A <= i*K <= B:
    print("OK")
    exit(0)

print("NG")

Solution (Python):

k = int(input())
a, b = map(int, input().split())

ans = 'NG'
for i in range(a, b + 1):
    if i % k == 0:
        ans = 'OK'
        break
print(ans)

Solution (Python):
K = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
    if i % K == 0:
        print("OK")
        break
else:
    print("NG")

Solution (Python):
import copy

def main():
    K = int(input())
    A, B = map(int, input().split(' '))
    origin = copy.copy(K) 
    
    while K < 1001:
        if K >= A and K <= B:
            print('OK')
            return
        K = K + origin
    print('NG')
main()

Solution (Python):
import numpy as np
def cumsum(x):
    return list(np.cumsum(x))

def cumsum_number(N,K,x):
    ans=[0]*(N-K+1)
    number_cumsum = cumsum(x)
    number_cumsum.insert(0,0)
    for i in range(N-K+1):
        ans[i]=number_cumsum[i+K]-number_cumsum[i]
    return ans
"""
int 
float 


for name in fruits: 
    print(name)


list0 = [] 
list0 = [1,2,3,4] 
list0 = [0]*10 
list1= [i for i in range(10)] 
list1 = list(map(int, input().split()))　
number=[int(input()) for i in range(int(input()))] 
list1 = list1 + [6, 7, 8] 
list2.append(34) 
list.insert(3,10) 
len(list4) 
max(sa) 
list5.count(2) 
list1.sort() 
list1.sort(reverse=True)  
set(list1) 
sum([2,3,   ,3]) 

abs(a) 
max(a,b) min(a,b) 
text1 = text1.replace("34","test") 

exit(0) 

cumsum(リスト) 
cumsum_number(N,K,x) 
"""
K=int(input())
A,B=map(int,input().split())
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        exit(0)
print("NG")

Solution (Python):
K=int(input())
A,B=map(int,input().split())
ans="NG"
for i in range(A,B+1):
    if  i%K==0:
        ans="OK"
print(ans)

Solution (Python):
import sys
import itertools

import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(input())
A, B = map(int, input().split())

for i in range(A, B + 1):
    if i % N == 0:
        print("OK")
        break
else:
    print("NG")

Solution (Python):
K=int(input())
A,B=(map(int,input().split()))
x=A//K
y=B//K+1
empty=0
for i in range(x,y):
    if A<=K*i<=B:
        empty=empty+1
if empty!=0:
    print('OK')
else:
    print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())

if a % k != 0:
    if k * ((a//k) + 1) <= b:
        print("OK")
    else:
        print("NG")
else:
        print("OK")

Solution (Python):
k=int(input())
a,b=map(int,input().split())

for i in range(a//k ,(b//k)+1):
  if k*i>=a and k*i<=b:
    print("OK")
    break
else:
    print("NG")

Solution (Python):
k = int(input())
a,b = map(int,input().split())
if a % k == 0:
    c = a
else:
    c = (a // k) * k + k
if c <= b:
    print("OK")
else:
    print("NG")

Solution (Python):
K = int(input())
A,B = map(int, input().split())
print('OK' if B//K*K>=A else 'NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
c = b // k
if c*k >= a:
    print("OK")
else:
    print("NG")

Solution (Python):
k = int(input())
a, b = map(int, input().split())
c = b // k
if c*k >= a:
    print("OK")
else:
    print("NG")

Solution (Python):
K=int(input())
A,B=map(int,input().split())
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        exit(0)
print("NG")

Solution (Python):
K = int(input())
A, B = map(int, input().split())

for i in list(range(A, B+1)):
  if i % K == 0:
    print('OK')
    exit()

print('NG')

Solution (Python):
k=int(input())
a,b=map(int,input().split())

for i in range(a,b+1):
    if i%k==0:
        print("OK")
        exit()
print("NG")

Solution (Python):
import math
K = int(input())
A, B = map(int, input().split())
ans=''

if K>B:
    ans='NG'
elif K>=A:
    ans='OK'
else:
    K=K*(math.ceil(A/K))
    if K>B:
        ans='NG'
    else:
        ans='OK'

print(ans)

Solution (Python):
k = int(input())
a, b = list(map(int, input().split()))

for i in range(a, b+1):
    if i % k == 0:
        print('OK')
        exit()
print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
f = 0
for i in range(a, b+1):
    if i%k == 0:
        f = 1

if f:
    print("OK")
else:
    print("NG")

Solution (Python):
K = int(input())
A,B = map(int,input().split())
i = 0

while True:
    if A <= K*i <=B:
        print('OK')
        break
    elif B < K*i:
        print('NG')
        break
    else:
        i += 1

Solution (Python):
k = int(input())
a,b = map(int, input().split())
c = 0
for i in range(a,b+1):
  if i%k==0:
    c+=1
if c>=1:
  print("OK")
else:
  print("NG")

Solution (Python):
k = int(input())
a, b =map(int,input().split())
for i in range(a,b+1):
    if i % k == 0:
        print('OK')
        break
else:
    print('NG')

Solution (Python):
k=int(input())
a,b=map(int,input().split())
l=list(range(a,b+1))
r=False
for i in l:
  if i%k==0:
    r=True
    break
print("NOGK"[r::2])

Solution (Python):
K = int(input())
A,B = map(int,input().split())

for a in range(A,B+1):
  if a%K==0:
    print("OK")
    break
else:
  print("NG")

Solution (Python):
k = int(input())
a,b = map(int,input().split())
flag = False


for x in range(a,b+1):
    if x % k == 0:
        flag = True
        break

if flag:
    print("OK")
else:
    print("NG")

Solution (Python):
K=int(input())
A,B=map(int,input().split())
flag=False
for i in range(1000):
  tmp=K*i
  if A<=tmp<=B:
    flag=True
    break
if flag:
  print('OK')
else:
  print('NG')

Solution (Python):

K = int(input())
A, B = map(int, input().split())
i = 0

while True:
  if i * K >= A:
    if i * K <= B:
      print("OK")
      break
    else:
      print("NG")
      break
  i += 1

Solution (Python):

N = int(input())
lists = list(map(int, input().split()))
if lists[0] % N == 0 or lists[1] % N == 0:
    print("OK")
elif ((lists[0]//N) * N) + N < lists[1]:
    print("OK")
else:
    print("NG")

Solution (Python):
k=int(input())
a,b=map(int,input().split())

if b//k!=(a-1)//k:
    print("OK")
else:
    print("NG")

Solution (Python):
k = int(input())
a,b = map(int,input().split())

if a%k != 0 and b%k != 0 and a//k == b//k:
  print("NG")
else:
  print("OK")

Solution (Python):
k=int(input())
a,b=map(int,input().split())

i=1
while k*i<=b:
  if a<=k*i:
    print('OK')
    exit(0)
  i+=1
print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
i = 0
for i in range(a, b + 1):
    if i % k == 0:
        print('OK')
        exit()
print('NG')

Solution (Python):
K = int(input())
a,b = map(int, input().split())
kekka = ("NG")
for i in range(a,b+1):
    if i % K == 0:
        kekka = ("OK")
print(kekka)

Solution (Python):
K = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
    if i % K == 0:
        print("OK")
        exit()
print("NG")

Solution (Python):
k = int(input())
[a,b] = [int(i) for i in input().split()]
f = 0
for i in range(a,b+1):
  if i % k == 0:
    f = 1
if f:
  print("OK")
else:
  print("NG")

Solution (Python):
def resolve():
	K = int(input())
	A, B = map(int, input().split())
	if any(i%K==0 for i in range(A, B+1)):
		print("OK")
	else:
		print("NG")
resolve()

Solution (Python):
k = int(input())
ab = [int(x) for x in input().split()]

m = int(ab[1] / k) * k

if ab[0] <= m:
    print("OK")
else:
    print("NG")

Solution (Python):
import sys
k = int(input())
a, b = map(int, input().split())
dist = list(range(a, b+1))

for d in dist:
    if d % k == 0:
        print('OK')
        sys.exit()

print('NG')

Solution (Python):
k=int(input())
a,b=map(int,input().split())
for i in range(a,b+1):
  if i % k == 0:
    print('OK')
    exit()
print('NG')

Solution (Python):
def we_love_golf():
    K = int(input())
    condition = input()
    condition_list = condition.split()
    A = int(condition_list[0])
    B = int(condition_list[1])
    
    for i in range(A, B+1):
        if i % K == 0:
            print('OK')
            return
    
    print('NG')
    return

we_love_golf()

Solution (Python):
k = int(input())
a, b = map(int, input().split())

for i in range(a, b+1):
  if i % k == 0:
    print('OK')
    exit()
print('NG')
exit()

Solution (Python):
import sys
from collections import deque
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())
def LS(): return list(sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))

def Main():
    k = I()
    a,b = IL()
    l = list(range(a,b+1))
    for rep in l:
        if rep%k==0:
            print('OK')
            exit()
    else:
        print('NG')
    return

if __name__=='__main__':
    Main()

Solution (Python):
K=int(input())
A,B=map(int,input().split())
print("OK" if A<=B//K*K<=B else "NG")

Solution (Python):
K = int(input())
A, B =map(int, input().split())
num = 0

for i in range(A, B+1):
    if i%K ==0:
        num +=1

print('OK' if num >0 else 'NG')

Solution (Python):
K = int(input())
A, B = map(int, input().split())

l = K
ans = 'NG'
for l in range(K, 1001, K):

    if l >= A and l <= B:
        ans = 'OK'
        break
    elif l > B:
        break

print(ans)

Solution (Python):
K = int(input())
A, B = map(int, input().split())

l = K
ans = 'NG'
while(l<= 1000):
    if l >= A and l <= B:
        ans = 'OK'
    l += K

print(ans)

Solution (Python):
K = int(input())
A, B = map(int, input().split())
for i in range(A,B+1):
  if i % K ==0:
    print("OK")
    exit()
else:
  print ("NG")

Solution (Python):
def main():

    k = int(input())
    a,b = list(map(int,input().split()))

    for i in range(a,b+1):
        if i%k == 0:
            return print('OK')

    return print('NG')


if __name__=='__main__':
    main()

Solution (Python):
def main():
  k=int(input())
  a,b = map(int,input().split())
  for i in range(1000):
    if(a<=i*k and i*k <= b):
      print("OK")
      return 0
  print("NG") 
  return 0

main()

Solution (Python):
import numpy as np
k = int(input())
a, b = map(int, input().split())
dif = np.arange(a, b+1)
dif_num = dif % k
if 0 in dif_num:
    print('OK')
else:
    print('NG')

Solution (Python):
import sys
k=int(input())
a,b=map(int,input().split())
for i in range(1001):
    if a<=k*i<=b:
        print("OK")
        sys.exit()
print("NG")

Solution (Python):
k = int(input())
a,b = map(int,input().split())
for i in range(a,b+1):
    if i%k == 0:
        print('OK')
        exit()
print('NG')

Solution (Python):
K= int(input())
A, B = map(int, input().split())
i = 0
while A <= B:
  if A / K == A // K:
    i = i + 1
    A = A + 1
  else:
    i = i + 0
    A = A + 1
    
if i == 0:
  print("NG")
else:
  print("OK")

Solution (Python):
k = int(input())
a, b = map(int, input().split())

if a%k == 0:
    print('OK')
else:
    nearest = a + (k - (a%k))
    if nearest <= b:
        print('OK')
    else:
        print('NG')

Solution (Python):
K=int(input())
A,B=map(int,input().split())
if (B//K)*K>=A:
    print("OK")
else:
    print("NG")

Solution (Python):
K = int(input())
A, B = map(int, input().split())
largest = (B // K) * K  
if A <= largest:
  print("OK")
else:
  print("NG")

Solution (Python):

import glob


REL_PATH = 'ABC\\165\\A'


TOP_PATH = 'C:\\AtCoder'

class Common:

    problem = []
    index = 0

    def __init__(self, rel_path):
        self.rel_path = rel_path

    def initialize(self, path):
        file = open(path)
        self.problem = file.readlines()
        self.index = 0
        return

    def input_data(self):
        try:
            IS_TEST
            self.index += 1
            return self.problem[self.index-1]

        except NameError:
            return input()

    def resolve(self):
        pass

    def exec_resolve(self):
        try:
            IS_TEST
            for path in glob.glob(TOP_PATH + '\\' + self.rel_path + '/*.txt'):
                print("Test: " + path)
                self.initialize(path)
                self.resolve()
                print("\n\n")
        except NameError:
            self.resolve()


class Solver(Common):

    def resolve(self):


        K = int(self.input_data())
        A, B = map(int,self.input_data().split())

        if A % K == 0 or B % K == 0:
            print('OK')
        elif int(A/K) < int(B/K):
            print('OK')
        else:
            print('NG')



solver = Solver(REL_PATH)
solver.exec_resolve()

Solution (Python):
k=int(input())
a,b=map(int,input().split())
ans='NG'
if b-a-1>=k:
  ans='OK'
else:
  for i in range(a,b+1):
    if i%k==0:
      ans='OK'
      break
print(ans)

Solution (Python):
k=int(input())
a,b = map(int,input().split())

flag=0
for n in range(a,b+1):
    if a%k==0:
        flag=1
        break
    else:
        a+=1

if flag==1:
    print('OK')
else:
    print('NG')

Solution (Python):
import numpy as np

k = int(input())
a, b = map(int, input().split())

driver_list = range(a, b+1, 1)
driver_arr = np.array(driver_list)
solver = driver_arr % k
if 0 in solver:
    print('OK')
else:
    print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())

for i in range(a, b+1):
    if i % k == 0:
        print('OK')
        exit()
print('NG')

Solution (Python):
k=int(input())
a,b=map(int,input().split())
if a%k==0 or b%k==0:
  print("OK")
else:
  if (a//k)==(b//k):
    print("NG")
  else:
    print("OK")

Solution (Python):

def main(k,a,b):
    for i in range(a,b+1):
        if i%k == 0:
            return print('OK')
    return print('NG')

if __name__=='__main__':
    k = int(input())
    a,b = list(map(int,input().split()))
    main(k,a,b)

Solution (Python):
k = int(input())
a, b = map(int, input().split())

for i in range(a, b + 1):
    if i % k == 0:
        print('OK')
        quit()

print('NG')

Solution (Python):
k = int(input())
a,b = map(int,input().split())
if b // k > a // k or a % k == 0:
  print('OK')
else:
  print('NG')

Solution (Python):
k = int(input())
a,b = map(int,input().split())
if k <= b - a:
  print('OK')
else:
  if b // k > a // k or a % k == 0:
    print('OK')
  else:

    print('NG')

Solution (Python):
k = int(input())
a,b = map(int,input().split())
if(b-a >= b%k):
  print('OK')
else:
  print('NG')

Solution (Python):
K = int(input())
A, B = map(int, input().split())

if A % K == 0:
    print("OK")
else:
    if (A//K+1)*K >= A and (A//K+1)*K <= B:
        print("OK")
    else:
        print("NG")

Solution (Python):
k = int(input())
a, b = map(int, input().split())
for i in range(a, b+1):
    if i % k == 0:
        print('OK')
        exit()
print('NG')

Solution (Python):
import sys
K = int(input())
A, B = map(int, input().split())

for i in range(A, B+1):
  if i % K == 0:
    print('OK')
    sys.exit()
print('NG')

Solution (Python):
K = int(input())
A,B = input().split(" ")

for num in range(int(A),int(B)+1):
  if num % K == 0:
    print("OK")
    exit()

print("NG")

Solution (Python):
import math
def fact(n):
    ans = 1
    for i in range(2, n+1):
        ans*= i
    return ans
def comb(n, c):
    return fact(n)//(fact(n-c)*c)

k = int(input())
a,b = map(int, input().split())
val = math.ceil(a/k)
if(b >= k*val):
    print('OK')
else:
    print('NG')

Solution (Python):

def main():
    K = int(input())
    A, B = map(int,input().split(' '))

    i = A
    while i <= B:
        if i % K ==0:
            print('OK')
            exit(0)
        i+=1
    print('NG')
        

if __name__ == "__main__":
    main()

Solution (Python):
k = int(input())
a, b = list(map(int, input().split()))
output = 'NG'
for i in range(a, b + 1):
  if i % k == 0:
    output = 'OK'
    break
print(output)

Solution (Python):
K = int(input())
A, B = map(int, input().split())

print("NG" if A%K != 0 and (A//K+1)*K >B else "OK")

Solution (Python):
K=int(input())
A,B=map(int,input().split())
ans="NG"
for i in range(A,B+1):
    if i%K==0:
        ans="OK"
        break
print(ans)

Solution (Python):
k = int(input())
line = input().split()
ans = "NG"
for i in range(int(line[0]),int(line[1])+1):
  if i%k ==0:
    ans = "OK"
    break
    
print(ans)

Solution (Python):
k = int(input())
a, b = map(int, input().split())
for i in range(1, b // k + 1):
    if a <= k * i <= b:
        print('OK')
        exit()
print('NG')

Solution (Python):
def check_baisuu(K, A, B):
  if (A % K == 0) or (B % K == 0):
    return True
  elif (A // K) < (B // K):
    return True
  else:
    return False

K, A, B = map(int, open(0).read().split())
if check_baisuu(K, A, B):
  print("OK")
else:
  print("NG")

Solution (Python):
k = int(input())
a, b = map(int, input().split())

def main():
  for i in range(a, b+1):
    if i % k == 0:
      return 'OK'
  return 'NG'

print(main())

Solution (Python):
N = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
  if i % N == 0:
    print('OK')
    break
else:
  print('NG')

Solution (Python):
k = int(input())
a, b = map(int,input().split())
flag = 0
 
for i in range(a, b+1):
  if i % k == 0 and flag == 0:
    print('OK')
    flag = 1
 
if flag == 0:
  print('NG')

Solution (Python):

K = int(input())
A,B = map(int,input().split())
ans = 'NG'
for x in range(A,B+1):
    if x%K==0:
        ans = 'OK'
        break
print(ans)

Solution (Python):
k = int(input())
a, b = list(map(int, input().split()))
if (a - 1) // k == b // k:
  print('NG')
else:
  print('OK')

Solution (Python):
K=int(input())
A,B=map(int,input().split())
ans='NG'
for i in range(A,B+1):
    if i%K==0:
        ans='OK'
        break
print(ans)

Solution (Python):
k=int(input())
a,b=map(int,input().split())
ans="NG"
for i in range(a,b+1):
    if i%k==0:
        ans="OK"
        break
print(ans)

Solution (Python):
k = int(input())
a, b = map(int, input().split())
print('OK' if a <= b // k * k else 'NG')

Solution (Python):
K = int(input())
A,B = map(int,input().split())
ans = 'NG'
for i in range(A,B+1):
  if i%K == 0:
    ans = 'OK'
    break
print(ans)

Solution (Python):
K = int(input())
A, B = map(int, input().split())
f = "NG"

for i in range(A, B + 1):
    if i % K == 0:
        f = "OK"

print(f)

Solution (Python):
K=int(input())
A,B=input().split(" ")
C=int(B)//K-int(A)//K
if int(B)%K==0 or int(A)%K==0:
  print("OK")
elif C==0:
  print('NG')
else:
  print("OK")

Solution (Python):
K = int(input())
A,B = map(int,input().split())
n = 1
while True:
    if A <= K*n and K*n <= B:
        print('OK')
        break
    elif K*n > B:
        print('NG')
        break
    n = n + 1

Solution (Python):
N = int(input())
A,B = map(int,input().split())
q = B // N
B = q * N
if A<=B:
  print("OK")
else:
  print("NG")

Solution (Python):
K = int(input())
A, B = map(int, input().split())
for _ in range(1000):
    if A%K==0:
        print("OK")
        break
    A+=1
    if A==B+1:
        print("NG")
        break

Solution (Python):
import sys
def main():
    K=int(sys.stdin.readline().strip())
    A,B=tuple(map(int,sys.stdin.readline().split()))
    x=(A//K)*K
    if A<=x or A<=x+K<=B:print('OK')
    else:print('NG')
if __name__=='__main__':main()

Solution (Python):
k = int(input())
a, b = map(int, input().split())

for i in range(a, b + 1):
    if i % k == 0:
        print("OK")
        exit()

print("NG")

Solution (Python):
K = int(input())
A, B = map(int, input().split())

input_list = list(range(A, B + 1))

flag = False

for i in input_list:
    if i % K == 0:
        flag = True

if flag:
    print('OK')
else:
    print('NG')

Solution (Python):
K = int(input())
A, B = map(int, input().split())

input_list = list(range(A, B + 1))

flag = False

for i in input_list:
    if i % K == 0:
        flag = True
        break

if flag:
    print('OK')
else:
    print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())

for i in range(a, b+1):
    if i % k == 0:
        print("OK")
        exit()
print("NG")

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    K = int(input())
    A, B = map(int, input().split())
    for i in range(A, B+1):
        if i%K == 0:
            print("OK")
            return
    print("NG")


if __name__ == "__main__":
    main()

Solution (Python):
Z=int(input())
A,B=map(int,input().split())
if B-A>=B%Z:
  print('OK')
else:
  print('NG')

Solution (Python):
k = int(input())
a,b = map(int,input().split())

if a % k == 0 or b % k == 0 or a//k-b//k :
  print("OK")

else:
  print("NG")

Solution (Python):
k=int(input())
a,b=[int(x) for x in input().split()]
ans=[]
for i in range(a,b+1):
  if i%k==0:
    ans.append(i)
    break
if ans==[]:
  print("NG")
else:
  print("OK")

Solution (Python):
K = int(input())
A, B = map(int, input().split())

for i in range(A, B+1):
  if i % K == 0:
    print('OK')
    exit()
print('NG')

Solution (Python):
N = int(input())
A,B = map(int,input().split())
ans = "NG"
for i in range(A,B+1):
  if i % N == 0:
    ans = "OK"
    break
print(ans)

Solution (Python):
k = int(input())
a, b = map(int, input().split())
B = b+1
for x in range(a, B):
    if x % k == 0:
        print('OK')
        break
else:
    print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
 
for x in range(a, b+1):
    if x % k == 0:
        print('OK')
        break
else:
    print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())

for x in range(a, b+1):
    if x % k == 0:
        print('OK')
        break
else:
    print('NG')

Solution (Python):
k=int(input())
a,b=map(int,input().split())
for i in range(a,b+1):
  if i % k == 0:
    print('OK')
    break
else:
  print('NG')

Solution (Python):


def main():
    import sys 
    input=sys.stdin.readline
    
    k=int(input())
    a,b =map(int ,input().split())
    
    for i in range(a,b+1):
        if i%k==0:
            print('OK')
            exit()
        
    print('NG')
    
    
if __name__=='__main__':
    main()

Solution (Python):
k = int(input())
a, b = map(int, input().split())

for i in range(a, b + 1):
    if i % k == 0:
        print('OK')
        break
else:
    print('NG')

Solution (Python):


"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time,random
start_time = time.time()



def solve():
    k = inp()
    a,b = invr()
    if a <= math.ceil(a / k) * k <= b:
        print("OK")
    else:
        print("NG")
                


 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 

def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def log_two(n): 
    return(math.log(n) / math.log(2))


        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Solution (Python):
K=int(input())
A,B=map(int,input().split())

if B//K!=A//K:
  print('OK')
elif A%K==0:
  print('OK')
else:
  print('NG')

Solution (Python):

def main():
    k = int(input())
    a,b = list(map(int,input().split()))

    for i in range(a,b+1):
        if i%k == 0:
            print('OK')
            return
    print('NG')

if __name__=='__main__':
    main()

Solution (Python):
k=int(input())
a,b=map(int,input().split())

for i in range(a,b+1):
    if i%k==0:
        print("OK")
        exit()
print("NG")

Solution (Python):
K=int(input())
A,B=map(int,input().split())

for i in range(1000):
    if A<=i*K and i*K<=B:
        print('OK')
        exit()
print('NG')
exit()

Solution (Python):
K = int(input())
list = list(map(int, input().split()))
while list[0]<=list[1]:
  if list[0]%K==0:
    print('OK')
    exit()
  list[0]+=1
print('NG')

Solution (Python):
k = input()
a,b = map(int,input().split())
flg = 0

for i in range(a,b + 1):
  if (i % int(k)) == 0:
    flg = 1
    break
if flg == 1:
  print("OK")
else:
  print("NG")

Solution (Python):
a = int(input())
b,c = map(int,input().split())
for i in range(b,c+1):
    if i % a == 0:
        print('OK')
        exit()
print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
for i in range(a, b + 1):
    if (i % k) == 0:
        print('OK')
        exit(0)

print('NG')

Solution (Python):
k = input()
a,b = input().split()
if int(b) // int(k) - int(a) // int(k) > 0:
    print('OK')
elif int(a) % int(k) == 0:
    print('OK')    
else:
    print('NG')

Solution (Python):
K = int(input())
A, B = map(int, input().split())

for i in range(A, B + 1):
    if i % K == 0:
        print('OK')
        break
else:
    print('NG')

Solution (Python):
k=int(input())
a,b=map(int, input().split())

for i in range(a,b+1):
  if i%k==0:
    print("OK")
    exit()
print("NG")

Solution (Python):
k = int(input())
a, b = map(int, input().split())

if k == 1:
    print('OK')
    exit()

if k > b:
    print('NG')
    exit()

for i in range(a, b + 1):
    if i % k == 0:
        print('OK')
        exit()

print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
if b//k*k >= a:
    print('OK')
else:
    print('NG')

Solution (Python):
K=int(input())
A,B=map(int,input().split())
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        exit()
print("NG")

Solution (Python):
K = int(input())
A,B =list(map(int,input().split()))
count =0
while count * K<A:
	count +=1
if count *K <=B:
	print("OK")
else:
	print("NG")

Solution (Python):
k = int(input())
a,b = map(int,input().split())
r = (b // k) * k
if a <= r: print('OK')
else: print('NG')

Solution (Python):
k=int(input())
a,b=map(int,input().split())
if b-a >= k:
  print("OK")
  exit()
for i in range(b-a+1):
  if (a+i)%k==0:
    print("OK")
    exit()
print("NG")

Solution (Python):
def solve():
     K = int(input())
     A, B = map(int, input().split())
     print('NOGK'[A+B%K<=B::2])


if __name__ == '__main__':
    solve()