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):

from collections import deque
from operator import itemgetter
from bisect import bisect_left, bisect
import itertools
import sys
import math
import numpy as np
import time
sys.setrecursionlimit(10**6)
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
k = int(input())
a, b = [int(elem) for elem in input().split()]


if a % k == 0 or b % k == 0:
    print('OK')
else:
    if k == 1:
        print('OK')
    elif a // k < b // k:
        print('OK')
    else:
        print('NG')

Solution (Python):
K = int(input())
A, B = [int(i) for i in input().split()]

i = 0;
while K*i<=B:
    if K*i>=A:
        print("OK")
        exit()
    i=i+1
        
print("NG")

Solution (Python):
from collections import *
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())
ab = list(map(int,input().split()))

f = False
i = ab[0]
while i <= ab[1]:
    if i % k == 0:
        print("OK")
        f = True
        break
    i += 1

if f is False:
    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())
ans="NG"
for i in range(a,b+1):
    if i%k==0:
        ans="OK"
print(ans)

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

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

Solution (Python):
k = int(input())
a,b = map(int,input().split())
i = a
while True:
    if i > b :
        print('NG')
        break
    elif i% k == 0:
        print('OK')
        break
    elif i % k != 0:
        i += 1

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

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

main()

Solution (Python):



                            
                            
                            
                            



import sys
import math as mt


def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))

def printwsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end="tst, ")

MOD = int(1e9+7); BABYMOD = 998244353;



k = int(input())
a, b = get_ints()
boo = False
if a%k == 0:
    boo = True
elif b%k == 0:
    boo = True
else:
    start = a // k
    end = b // k
    if start != end:
        boo = True
if boo:
    print("OK")
else:
    print("NG")



'''
THE LOGIC AND APPROACH WAS DEVELOPED BY ME @luctivud.
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
PLEASE DO NOT PLAGIARISE.
'''

Solution (Python):
import bisect,sys
import math
from collections import deque

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max, mod=DIV):
    fac, finv, inv = [0]*max, [0]*max, [0]*max
    fac[0] = fac[1] = 1
    finv[0] = finv[1] = 1
    inv[1] = 1
    for i in range(2, max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod - inv[mod % i] * (mod//i) % mod
        finv[i] = finv[i-1]*inv[i] % mod

    class CONV:
        def __init__(self):
            self.fac =fac
            self.finv = finv
            pass

        def ncr(self, n, k):
            if(n < k):
                return 0
            if(n < 0 or k < 0):
                return 0
            return fac[n]*(finv[k]*finv[n-k] % DIV) % DIV
        
    return CONV()



sys.setrecursionlimit(200005)


def main():
    K = iRaw()
    A,B = isRaw()
    div = A//K
    if A%K !=0:
        div+=1
    ans = "OK" if (div*K) <= B else "NG"
    return ans

if __name__ == "__main__":
    print(main())

Solution (Python):


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    K = read_int()
    A, B = read_ints()
    a = A//K
    if a*K == A or (a+1)*K <= B:
        return 'OK'
    return 'NG'


if __name__ == '__main__':
    print(solve())

Solution (Python):
K = int(input())
A, B = list(map(int, input().split()))
s = A // K
ret = 'OK' if (A <= s * K <= B) or (A <= (s+1)*K <= B) else 'NG'
print(ret)

Solution (Python):
K = int(input())
AB = list(map(int,input().split()))

flag = 0

for cnt in range(AB[0],AB[1]+1):
    if (cnt % K == 0):
        flag = 1
        break
        


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

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

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())
l= input().split(' ')
a=int(l[0])
b=int(l[1])

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

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

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

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

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

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


if ans == 1:
    print("OK")
else:
    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):

import math

inp = input()
K = int(inp)


inp = input().split(' ')
A, B = int(inp[0]), int(inp[1])

A_ceil = math.ceil(A/K)*K
if A_ceil <= B:
    print('OK')
else:
    print('NG')

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

a = A//K
b = B//K

flag = 0

for i in range(a,b+1):
    N = K*i
    if A<= N <= B:
        flag = 1
        print("OK")
        break

if flag == 0:
    print("NG")

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

OK=False
for n in range(A,B+1):
    if n%K==0:
        OK=True
        break

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

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

Solution (Python):
"""
    This template is made by Satwik_Tiwari.
    python programmers can use this template :)) .
"""




import sys
import bisect
import heapq
from math import *
from collections import Counter as counter  
from itertools import combinations as comb 
from itertools import permutations as permutate
from bisect import bisect_left as bl 
from bisect import bisect_right as br
from bisect import bisect




mod = pow(10, 9) + 7
def inp(): return sys.stdin.readline().strip() 
def out(var): sys.stdout.write(str(var))  
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
def graph(vertex): return [[] for i in range(0,vertex+1)]
def zerolist(n): return [0]*n
def nextline(): out("\n")  
def testcase(t):
    for p in range(t):
        solve()
def printlist(a) :
    for p in range(0,len(a)):
        out(str(a[p]) + ' ')
def lcm(a,b): return (a*b)//gcd(a,b)





def solve():
    k = int(inp())
    a,b = sep()
    if (b//k) - (a//k) > 0:
        print('OK')
    else:
        if(k == 1):
            print('OK')
        else:
            if(a%k == 0 or b%k==0):
                print('OK')
            else:
                print('NG')



testcase(1)

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

Solution (Python):
k = int(input())
a,b = map(int,input().split())
ans = [i for i in range(a,b+1)]
flag = False
for i in ans:
    if i%k == 0:
        flag = True
        break
if flag == True:
    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())
result=0
for i in range(1000):
  tmp=K*i
  if A<=tmp<=B:
    result=1
    break
  if tmp>B:
    break
if result==1:
  print("OK")
else:
  print("NG")

Solution (Python):
K = int(input())
A, B = (int(_) for _ in input().split())
b = B//K
a = (A-1)//K
if b - a >= 1:
  print('OK')
else:
  print('NG')

Solution (Python):
import sys


sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


def main():
    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")


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):
k = int(input())

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


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

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

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

flag = False
for i in range(1, 1000):
    if A <= K * i <= B:
        flag = True

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

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

if flg == 0:
    print("NG")
else:
    print("OK")

Solution (Python):
K = int(input())
A, B = list(map(int, input().split()))
tmp = 0
while(True):
  tmp += K
  if A<= tmp <=B:
    print("OK")
    break
  elif tmp > B:
    print("NG")
    break

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

if a % k == 0:
    print('OK')
    exit()
if b % k == 0:
    print('OK')
    exit()

if b//k - a//k == 0:
    print('NG')
else:
    print('OK')

Solution (Python):
k=int(input())
[a,b]=list(map(int,input().split()))
a1=a//k
if a<=a1*k<=b or a<=(1+a1)*k<=b:
    ans="OK"
else:
    ans="NG"
print(ans)

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

res = False
for i in range(1000):
    k = i * K
    if k >= A and k <= B:
        res = True

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

Solution (Python):
k = int(input())
a, b = [int(x) for x in 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())
val=b//k
if val*k in range(a,b+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")
        exit()

print("NG")

Solution (Python):
from sys import stdin

K = int(stdin.readline().rstrip())
[A, B] = [int(x) for x in input().rstrip().split()]


flag=0
K_temp=K
while(True):
    if(K_temp>B):
        break
    if(K_temp>=A and K_temp<=B):
        flag=1
        break
    else:
        K_temp+=K

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

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

if(flg==0):
    print("NG")

Solution (Python):
k=int(input())
a,b=map(int,input().split())
i=0
while 1:
  i+=1
  if k*i>b:
    print('NG')
    exit()
  elif a<=k*i<=b:
    print('OK')
    exit()

Solution (Python):
from sys import stdin
import sys
import math




K = int(input())

A, B = [int(x) for x in stdin.readline().rstrip().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(" "))
a=0
for i in range(A, B+1):
    if i%K==0:
        a=1
        break
    else:
        a=0
if a==1:
    print("OK")
else:
    print("NG")

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

ans = b // k * k

if ans >= a:
    print("OK")
else:
    print("NG")

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
        break

if c == 0:
    print("NG")
else:
    print("OK")

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

Solution (Python):
k=int(input())
a,b=map(int,input().split())
x=b//k
if a<=x*k:
    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())
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(1, 1001):
    if a <= k * i <= b:
        print("OK")
        exit()

print("NG")

Solution (Python):

import sys

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

P = 0
while True:
    if A <= P <= B:
        print("OK")
        sys.exit()
    elif B < P:
        print("NG")
        sys.exit()

    P += K

Solution (Python):
i = input()
k = list(map(int, input().split()))
frag = False
for p in range(k[0], k[1]+1):
    if p % int(i) == 0:
        frag = True
        break
if frag:
    print("OK")
else:
    print("NG")

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

if B - A >= K:
    res = "OK"
else:
    for i in range(B - A + 1):
        if (A + i) % K == 0:
            res = "OK"

print(res)

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

cur = K

while True:
  if A <= cur <= B:
    print("OK")
    break
  elif cur > B:
    print("NG")
    break
  else:
    cur += K

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==0:
    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):
k = int(input())
a,b = map(int, input().split())

ka = a//k
kb = b//k

if a % k ==0:
    print("OK")
    exit()
elif b % k ==0:
    print("OK")
    exit()
elif kb -ka >0:
    print("OK")
    exit()
else:
    print("NG")

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

q1()

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

ans = K * (A//K)
ans2 = ans + K

if (A <= ans <= B) or (A <= ans2 <= B):
    print('OK')
else:
    print('NG')

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

Solution (Python):
K = int(input())
A, B = map(int, input().split())
count = 1
check = 0
flag = False
while check < B:
    check = K * count
    if A <= check and check <= B:
        flag = True
    count += 1

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

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

i = int(A/K)*K
if i<A:
    i += K

if B>=i:
    print('OK')
else:
    print('NG')

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

a,b=[int(x) for x in input().split()]
flag=0
for i in range(a,b+1):
    if i%n==0:
        flag=1
        break
if flag==0:
    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=[int(x) for x in input().split()]
flag=0
for i in range(a,b+1):
    if(i%n==0):
        flag=1
        break
if(flag==1):
    print('OK')
else:
    print('NG')

Solution (Python):
k=int(input())
l,r=[int(x) for x in input().split()]
if l//k == r//k and l%k!=0 and r%k!=0: 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):
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 range(a,b+1):
    if i % k == 0:
        result = "OK"
        break
    else:
        result = "NG"

print(result)

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

    for i in range(10000):
        if a <= k*i and k*i <= b:
            return 'OK'
        elif b <= k*i:
            return 'NG'


print(solve())

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

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

if t==0:
  print("NG")

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

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

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

l=[]
x=0
for i in range(a,b+1):
    l.append(i)
for i in l:
    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())

ans='NG'
i=1
while i*K<=1000:
    if A<=i*K<=B:
        ans='OK'
    i+=1

print(ans)

Solution (Python):
import sys
k = int(sys.stdin.readline())
a, b = map(int, input().split())

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

Solution (Python):
k = int(input())
a,b = [int(i) for i in input().split()]
end_flag = False
for i in range(a,b+1):
    if i % k == 0 and i //k >= 1:
        end_flag = True
        break
print('OK' if end_flag else 'NG')

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

Solution (Python):
def main():
  k = int(input())
  
  
  a,b = list(map(int,input().split()))
  
  
  
  
  ans = 0
  count = 0
  lis = []
  
  for i in range(a,b+1):
    if i % k == 0:
      print("OK")
      exit()
  print("NG")

if __name__ == '__main__':
  main()

Solution (Python):
def resolve():
    
    k = int(input())
    
    A, B = list(map(int, input().split()))
    
    
    
    
    
    

    r=False
    for i in range(A, B+1):
        if i % k == 0:
            print("OK")
            r=True
            break

    if r ==False:
        print("NG")

    


resolve()

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

ans = 'NG'
if a%k == 0 or b%k ==0:
    ans = 'OK'
if a//k < b//k:
    ans = 'OK'

print(ans)

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

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

Solution (Python):
a = int(input())
q, w = map(int, input().split())
ans = False
for i in range(1000):
    if a * i >= q and a * i <= w:
        ans = True

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

Solution (Python):
import random
import math
LI = lambda: list(map(int,input().split()))
MI = lambda: map(int,input().split())
yes = lambda: print("Yes")
no = lambda: print("No")
I = lambda: list(input())
J = lambda x: "".join(x)
II = lambda: int(input())
SI = lambda: input()

t = II()
a,b = MI()
boo = False
for i in range(a,b+1):
	if i%t == 0:
		boo = True
		break
print("OK" if boo else "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 == 0:
  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()
else:
    print('NG')

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

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

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

a = ab[0]
b = ab[1]

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-1)//k)*k<=b:
    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):
n = int(input())
a,b = map(int,input().split())
x = b//n
y = n*x

if y>=a and y<=b:
    print("OK")
else:
    print("NG")

Solution (Python):
n = int(input())
A, B = input().split()
a=int(A)
b=int(B)
f=0
for i in range(a,b+1):
    if i%n==0:
        print("OK")
        f=0
        break
    f=1
   
if f==1:
    print("NG")

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

Solution (Python):
k = int(input())
a, b = map(int, input().split())
tmp = 0
for i in range(a, b+1):
    if i % k == 0:
        tmp = 1
if tmp:
    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())

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

print("NG")

Solution (Python):
c=int(input())
a,b=map(int,input().split())
st="n"
for i in range(a,b+1):

    if i%c==0:
        st="Q"
        print("OK")
        break
if st=="n":
    print("NG")

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
    break
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")
    exit()
print("NG")

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

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

if flag:
    print("NG")

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())  

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

print("NG")

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

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


ans="NG"
a=B-A

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 = 0

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

if ans > 0:
    print("OK")
elif ans == 0:
    print("NG")

Solution (Python):
K=int(input())
A,B=map(int,input().split())
b=B//K
if A<=b*K:
	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())
num=1
while K*num<=B:
  if A<=K*num and K*num<=B:
    print('OK')
    sys.exit()
  num+=1
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())
c = True
for i in range(a, b+1):
  if i%k ==0:
    print("OK")
    c = False
    break
if c:
  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 = [int(s) for s in input().split()]
message = 'NG'
for i in range(1000):
    if A <= i * K and i * K <= B:
        message = 'OK'
print(message)

Solution (Python):
def I(): return int(input())
def LI(): return list(map(int,input().split()))
K = I()
A,B = LI()
Sequence = [i for i in range(A,B+1)]
for i in range(B//K+1):
    if K*i in Sequence:
        print('OK')
        break
else:
    print('NG')

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 == 0:
    print('NG')
else:
    print('OK')

Solution (Python):

k = int(input())

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

res = "NG"

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

print(res)

Solution (Python):
k=int(input())
a,b =map(int,input().split())
m=a//k
l=b//k
if a==m*k or b==l*k:
    print("OK")
elif m==l:
    print("NG") 
else:
    print("OK")

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

ans = "NG"
for i in range(1000):
    if a <= k * i <= b:
        ans = "OK"
        break

print(ans)

Solution (Python):

def solve():

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

    i = 0

    while True:
        if A <= i <= B:
            print("OK")
            exit()
        elif B < i:
            print("NG")
            exit()

        i += K


if __name__ == "__main__":
    solve()

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')
        break
else:
    print('NG')

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

match = False
for i in range(A, B+1):
    if i % K == 0:
        match =True
    
print("OK" if match else "NG")

Solution (Python):
N = int(input())
a, b = map(int, input().split())
i=a
j=0
while i<=b:
    if i%N==0:
        j=1
        break
    i+=1
if j==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")
   exit()
print("NG")

Solution (Python):
K=int(input())
N,M=map(int,input().split())
FLAG=0
for i in range(1000):
    if K*i>=N and K*i<=M:
        print("OK")
        FLAG=1
        break
if FLAG==0:
    print("NG")

Solution (Python):
def main():
    k=int(input())
    a,b=map(int,input().split())
    d=a//k
    tmp=k*d
    while tmp<=b:
        if tmp>=a and tmp<=b:
            print('OK')
            exit()
        tmp+=k
    print('NG')

if __name__=='__main__':
    main()

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

t = 0
flg = False
for i in range(1000):
    t += K
    if A <= t <= B:
        flg = True
        break
    if t > B:
        break

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

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

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

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

Solution (Python):
import bisect
import copy
import heapq
import math
import sys
from collections import *
from itertools import accumulate, combinations, permutations, product
from math import gcd
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

k=int(input())
a,b=map(int,input().split())
tmp=0
while tmp<=b:
    tmp+=k
    if a<=tmp<=b:
        print("OK")
        quit()
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):
a=int(input())
b,c=map(int, input().split())


if b//a<c//a or b%a==0 or c%a==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")
        exit()
print("NG")

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

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