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

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())
l = []

for i in range(1,1001):
  if  a <= i*k and i*k <= b:
    print('OK')
    exit()
    
print('NG')

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

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

num = a
flag = True

while num <= b:
    if num % k == 0:
        print("OK")
        flag = False
        break
    num = num + 1
    
if flag:
    print("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):
k = int(input())
a,b = map(int,input().split())
res = []
for i in range(a,b+1):
    if i % k == 0:
        res.append(True)
    else:
        res.append(False)
if any(res):
    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())

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")
else:
    cur = k
    while cur < a:
        cur += k
    
    if a <= cur <= 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):
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 = 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 = list(map(int, input().split()))
flg = 1
for i in range(A, B+1):
    if i%K == 0:
        print('OK')
        flg = 0
        break
if (flg):
    print('NG')

Solution (Python):
import math

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

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

Solution (Python):
k=int(input())
a,b=map(int,input().split())
f=0
for i in range(1,1001):
  if a<=i*k<=b:
    print("OK")
    f=1
    break
if f==0:
  print("NG")

Solution (Python):
K = int(input())
[A, B] = list(map(int, input().split()))
for i in range(A, B + 1):
    X = i / K
    Y = i // K
    if X == Y:
        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())

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

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

"""
Spyderエディタ

これは一時的なスクリプトファイルです
"""
k = int(input())
under, upper = map(int, input().split())
ans = 'NG'
for i in range(under, upper + 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):
import itertools
import math
import fractions
import functools
k = int(input())
a, b = map(int, input().split())
count = 0
for i in range(a,b+1):
    if i % k == 0: count += 1

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

Solution (Python):
K = int(input())
A, B = map(int, input().split())
d = A // K
r = A % K

if r == 0:
  print("OK")
elif K*(d+1) >= A and K*(d+1) <= B:
  print("OK")
else:
  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 = [int(n) for n in input().split()]

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

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):
K = int(input())
A, B = map(int, input().split())

for i in range(0, 1000):
    Ki = K * i
    if A <= Ki <= B:
        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())


f= False
for d  in range (a,b+1):
    if d % k == 0:
        f=True
        break


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

Solution (Python):
root = int(input())
ranges = list(map(int, input().split()))
flag = False

for i in range(ranges[0], ranges[1] + 1):
    if i % root == 0:
        flag = True
        
if flag: 
    print('OK')
else:
    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 num in range(k, 1001, k):
    if a <= num <= b:
        print('OK')
        exit()
print('NG')

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


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

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

Solution (Python):


hage = int(input())
hoge = input().split()
 
hoge[0] = int(hoge[0])
hoge[1] = int(hoge[1])

renji = int(hoge[0]) - int(hoge[1])
 
e = hage
 
while e <= hoge[1]:
    if hoge[0] <= e and hoge[1] >= e:
        print("OK")
        break
    e = e + hage
if e > hoge[1] or e < hoge[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):
K = int(input())
A,B = map(int,input().split(" "))
n=0
s='NG'
while(n<=B):
    n+=K
    if A<=n and n<=B:
        s='OK'
print(s)

Solution (Python):
import sys

sys.setrecursionlimit(10**7)

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

k = ni()
a, b = na()
for i in range(1, b//k+2):
    if a <= i*k <= b:
        print('OK')
        exit(0)
print('NG')

Solution (Python):
import sys
K = int(input())
A, B = map(int,(input().split()))
i=1
while(K*i<=B):
  if(K*i>=A):
    print("OK")
    sys.exit()
  i+=1
print("NG")

Solution (Python):



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

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

if flag:
    print("NG")

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

Solution (Python):
if __name__ == '__main__':
    k = int(input())
    [a,b] =[int(i) for i in input().split()]
    if a%k == 0 or b >= a + (k - a%k):
        print("OK")
    else:
        print("NG")

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

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

c = b - a

res = b % k

if res <= c:
    print("OK")
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("NG")
    
else:
  print("OK")

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

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

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

if golf(A,B,K) == 0:
    print("OK")
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:
    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 (b//k+1):
  if a<=(k*i)<=b:
    print("OK")
    flag=True
    break
if flag==False:
  print("NG")

Solution (Python):
from sys import stdin

K = int(stdin.readline().rstrip())
A, B = [int(x) for x in stdin.readline().rstrip().split()]
print('OK' if any([i%K==0 for i in range(A, B+1)]) else 'NG')

Solution (Python):


import sys
INT_MAX = sys.maxsize
INT_MIN = -(sys.maxsize)-1
sys.setrecursionlimit(10**7)
mod = 1000000007


def IOE():
    sys.stdin = open("input.txt", "r")
    sys.stdout = open("output.txt", "w")


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


if __name__ == "__main__":
    try:
        IOE()
    except:
        pass
    main()

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

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

amari = b % k

ans = 'NG'
if k <= b:
    if b-a >= amari:
        ans =  'OK'

print(ans)

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

Solution (Python):
def is_fly(k,a,b):
  for i in range(a,b+1):
    if(i % k == 0):
      return True
  return False

k = int(input())
a,b = (int(x) for x in input().split())
if(is_fly(k,a,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')
    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):
K = int(input())
A, B = list(map(int, input().split()))

while True:
    if A == B + 1:
        print('NG')
        break
    if A % K == 0:
        print('OK')
        break
    A += 1

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

while True:
    if A % K == 0:
        print('OK')
        break
    A += 1
    if A == B + 1:
        print('NG')
        break

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

res = 0
i = a

while i <= b:
    if i % k == 0:
        res = 1
    i += 1


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

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

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

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

Solution (Python):
def main():
    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('OK')
    else:
        print('NG')


if __name__ == "__main__":
    main()

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

Solution (Python):



def main() -> None:
    K = ri()
    A, B = rmi()
    for trial in range(A, B + 1):
        if trial % K == 0:
            w('OK')
            return
    w('NG')


def r() -> str:
    return input().strip()


def ri() -> int:
    return int(r())


def rmi(delim: str = ' ') -> tuple:
    return tuple(map(int, input().split(delim)))


def w(data) -> None:
    print(data)


def wm(*data, delim: str = ' ') -> None:
    print(delim.join(map(str, data)))


if __name__ == '__main__':
    import sys
    sys.setrecursionlimit(10**9)
    main()

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

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

for i in range(1000):
  if A <= K*i <= B:
    print('OK')
    sys.exit(0)

print('NG')

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

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

if (B//K)-((A-1)//K)>0:
    print("OK")
else:
    print("NG")

Solution (Python):
n = int(input())
a, b = map(int, input().split())
if a <= b//n*n:
    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")
        break
else:
    print("NG")

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

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

if (A-1)//K!=B//K:
    print('OK')
else:
    print('NG')

Solution (Python):
n=int(input())
a,b=map(int,input().split())
c=1
while n*c<a:
  c+=1
if a<=n*c<=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:
    a = True
    break
  else:
    a = False

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

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

if A % K == 0:
  print('OK')
else:
  out = round(A/K+0.5)
  if A <= out*K <= B:
    print('OK')
  else:
    print('NG')

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

for n in range(a, b + 1):
	if n % 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")
        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'); exit()

print('NG')

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

Solution (Python):
K=int(input())
A,B=map(int,input().split())
flag=True
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        flag=False
        break
if flag:
    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:
        continue
else:
    print('NG')

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

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

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())
low, high = map(int, input().split())

if (low % K == 0) or (high % K == 0):
  print("OK")
else:
  if ((low // K) + 1) * K <= high:
    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 b//k - a//k == 0 and a%k != 0:
  print('NG')
else:
  print('OK')

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())
print("OK") if a<=b//k*k 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 ((A // K != B // K) or A % K == 0 or B % K == 0):
	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(0)

print('NG')

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

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

Solution (Python):
def i():
    return int(input())
def i2():
    return map(int,input().split())
def s():
    return str(input())
def l():
    return list(input())
def intl():
    return list(int(k) for k in input().split())

k=i()
a,b=i2()
for i in range(1000):
	if i*k>=a and i*k<=b:
		print('OK')
		exit()
print('NG')

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

print(result)

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(e) for e in input().split()]
ans='NG'
for i in range(a,b+1):
    if i%k == 0:
        ans='OK'
        break
    else:
        pass
print(ans)

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

import numpy as np

ab = np.zeros((b-a)+1)

ab[:] = a

for i in range(b-a):
    ab[i+1:] +=1

if (ab % k == 0).sum() > 0:
    print('OK')
else:
    print('NG')

Solution (Python):
import sys


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

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

    print('NG')


if __name__ == "__main__":
    main()

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

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

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

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

import sys

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


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>=2:
    print("OK")
elif b/k>=2:
    print("OK")
elif a%k==0:
    print("OK")
elif b%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 and i%K==0):
    print("OK")
    break
else:
  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(' '))

ans = 'NG'

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

print(ans)

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(" "))
counter=0
if (A<=1000) and B <=1000 and A<=B:
    for i in range(A,B+1):
        
        if i%K == 0:
            counter=1
    if counter==1:
        print("OK")
    else:
        print("NG")

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

def calc(K,a,b):
    
    for i in range(a,b+1):
        
        if i % K ==0:
            
            return "OK"
    return "NG"


print(calc(K,a,b))

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

Solution (Python):
K = int(input())
A, B = map(int, input().split())
 
s = (B // K) * K
if A <= s: 
    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 = list(map(int, input().split()))

mod_a = A%K
mod_b = B%K
sub = B-A
sub_div = int(sub/K)

if((sub_div >= 1) or (mod_a == 0) or (mod_b == 0)) :
  print("OK")
else :
  if(mod_a > mod_b) :
    print("OK")
  else :
    print("NG")

Solution (Python):
from sys import stdin, stdout
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()

def main():
	k = int(rl())
	a, b = (int(x) for x in rll())
	for x in range(a, b+1):
		if x % k == 0:
			stdout.write("OK");stdout.write("\n")
			return
	stdout.write("NG");stdout.write("\n")
	stdout.close()

if __name__ == "__main__":
	main()

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

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

Solution (Python):
import math
import sys

K = int(input())
distance = list(map(int,input().split()))


for i in range(distance[1]-distance[0]+1):
    if (distance[0]+i) % K == 0:
        print("OK")
        sys.exit()

print("NG")

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

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

r = False
for d in range(A, B+1):
    if d % K == 0:
        r = True

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

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

Solution (Python):
K=int(input())
A,B=map(int,input().split())
 
for i in range(A, B+1):
  if(i>=K and i%K==0):
    print("OK")
    break
else:
  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")
        break
else:
    print("NG")

Solution (Python):
K = int(input())
A, B = map(int, input().split())
now = K
while now <= 1000:
  if now >= A and now <= B:
    print('OK')
    exit()
  now += K

print('NG')

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


for i in range(100):
    if A <= K * i <= B:
        print('OK')
        break
    else:
        if i == 99:
            print('NG')

Solution (Python):
K = int(input())
A, B = map(int, input().split())
n = 1
result = False
while n * K <= 1000:
 if A <= n * K and n * K <= B:
  result = True
  break

 n += 1

if result:
 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())
i = list(map(int, input().split()))

if i[0] % K == 0 or (int(i[0] / K) + 1) * K <= i[1]:
    print('OK')
else:
    print('NG')

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

Solution (Python):

import sys
k = int(input())
a, b = list(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(tmp)for tmp in input().split()]
cek = False
for i in range(a, b+1) :
  if i % k == 0 :
    cek = True
    break
if cek :
  print("OK")
else :
  print("NG")

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

for i in range(a,b+1):
    
    if i % n == 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")
        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 and i >= k):
        print("OK")
        break
else:
    print("NG")

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

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

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

print('NG')

Solution (Python):
import math

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

if math.floor(b/k) - math.floor(a/k) >= 1 :
    print("OK")
elif a%k == 0 or b%k == 0 :
    print("OK")
elif a<=k and k<=b:
    print("OK")
else:
    print("NG")

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

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

if C >= 1 and D < 1:
    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):
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):
def input_from_console():
    k = int(input().rstrip())
    a, b = map(int, input().split())
    return k, a, b


def solve(k, a, b):
    result = "NG"
    if a % k == 0 or (b // k > a // k):
        result = 'OK'
    return result


def main():
    k, a, b = input_from_console()
    print(solve(k, a, b))


if __name__ == "__main__":
    import sys

    if sys.gettrace():  
        check_cases()
    else:
        main()

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

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

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

print(a)

Solution (Python):
K = int(input())
nums = [int(e) for e in input().split()]

L = nums[1]//K * K

if nums[0] <= L:
    print('OK')
else:
    print('NG')

Solution (Python):
K = int(input())
nums = [int(e) for e in input().split()]

if nums[0]%K == 0:
    l = nums[0]//K
    m = nums[1]//K
else:
    l = nums[0]//K + 1
    m = nums[1]//K

if l <= m:
    print('OK')
else:
    print('NG')

Solution (Python):
K = int(input())
A, B = map(int, input().split())
 
l = 0
ret = 'NG'
while l <= B:
  if l >= A:
    ret = 'OK'
  l += K
  
print(ret)

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

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

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

da = input().split(' ')
ok = False

for i in range(int(da[0]),int(da[1]) + 1):

    if i % k == 0:

        ok = True


if ok:

    print('OK')

else:

    print('NG')

Solution (Python):

K = int(input())

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

fly = K
result = False

while fly <= B:
    if A <= fly <= B:
        result = True
        break
    fly += K

if result is True:
    print("OK")
else:
    print("NG")

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

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

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

Solution (Python):
K = int(input())
l = [int(x) for x in input().split()]
A, B = l[0], l[1]

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

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):
k = int(input())
a, b = [int(x) for x in input().split()]

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

Solution (Python):
import math

array = []

for i in range(2):
    val = input()
    array.append(val.split())

K = int(array[0][0])
A = int(array[1][0])
B = int(array[1][1])

compare = math.floor(B / K) * K

if compare >= A:
    print("OK")
else:  
    print("NG")