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())
q=0
 
for i in range(1,1000):
  if a<=k*i and k*i<=b:
    print('OK')
    q=1
    break
 
if q==0:
  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=map(int,input().split())

ans=B//K-(A-1)//K
if ans>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= map(int, input().split())
q=0

for i in range(1,1000):
  if a<=k*i and k*i<=b:
    print('OK')
    q=1
    break

if q==0:
  print('NG')

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

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

Solution (Python):
import math
k=int(input())
[a,b]=list(map(int, input().split()))
A=math.floor(a/k)
B=math.floor(b/k)
if A!=B:
  print("OK")
elif k==1:
  print("OK")
elif a%k==0 or b%k==0:
  print("OK")
else:
  print("NG")

Solution (Python):
def N():
    return int(input())
def L():
    return list(map(int,input().split()))
def NL(n):
    return [list(map(int,input().split())) for i in range(n)]
mod = pow(10,9)+7

k = N()
a,b = L()
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())
valid = False
for i in range(A,B+1):
    if i % K == 0:
        valid = True
        break
if valid:
    print("OK")
else:
    print("NG")

Solution (Python):
k = int(input())
a, b = map(int,input().split())
list1 = []
x =(k+a-1)//k
y = b // k

for i in range(x,y+1):
  list1.append(i)
if list1 == []:
  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')
        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())

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())
ans=0
i=1
while K*i<=1000:
    if A<=K*i and K*i<=B:
        ans=1
        break
    i+=1
if ans==1:
    print("OK")
else:
    print("NG")

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

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 = (int(i) for i in input().split())

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

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

ans = False
count = K
while count <= B:
    if A <= count and count <= B:
        ans = True
    count += K

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

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

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

main()

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

for i in range(B//K+1):
    if A<=K*i and K*i<=B:
        cnt+=1
print('OK' if cnt>0 else 'NG')

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    k = int(readline())
    a, b = list(map(int, readline().split()))
    for i in range(a, b + 1):
        if i % k == 0:
            print("OK")
            exit()
    print("NG")


if __name__ == '__main__':
    solve()

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())
ans = 'OK' if B//K-(A-1)//K > 0 else 'NG'
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())
if b // k - a // k > 0:
    print('OK')
elif a % k == 0:
    print('OK')
else:
    print('NG')

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

for num in range(A, B+1, 1):
  if num % 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):
  ans = 'NG'
  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):
target = int(input())
a, b = map(int, input().split())

b_largest = (b // target) * target

print('OK' if b_largest >= a else 'NG')

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

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

if cnt >= 1:
    print("OK")
else:
    print("NG")

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

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

Solution (Python):
K = int(input())
AB = input().split()
A = int(AB[0])
B = int(AB[1])

if int(B / K) * K >= A:
  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 A//K==B//K:print('NG')
else:print('OK')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
for n in range(a, b+1):
    if n % k == 0:
        print('OK')
        break
    if n == b:
        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 or 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(1000):
    if a <= k*i <= b:
        print("OK")
        break
else:
    print("NG")

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

if a % k != 0 and a // k == b // k:
    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 = list(map(int, input().split()))
m = B%K
print('OK') if B-m >= A 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
    print("OK")
    break
if flag == 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:
        print('OK')
        exit()

print('NG')

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

range_max = int(b / k) * k
if range_max >= a:
    print('OK')
else:
    print('NG')

Solution (Python):
N = int(input())
A,B=map(int,input().split())
Na = N
while N <= 1000:
    if A <= N and N <= B:
        print("OK")
        break
    N = N+Na
if N>1000:
    print("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):
k=int(input())
a,b=map(int,input().split())
cnt=0
for i in range(a, b+1):
    if i%k==0:
        cnt+=1
if cnt>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):
def resolve():
    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')

resolve()

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

while True:
    if a % k == 0:
        print("OK")
        break
    if a == b:
        print("NG")
        break
    a += 1

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

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

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

ans = False
tmp = k

while tmp <= b:
    if (tmp >= a) and (tmp <= b):
        ans = True
        break
    else:
        tmp += k

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

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

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

Solution (Python):
k=int(input())
import sys
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())

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

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

MaxKx = B//K*K

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

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

main()

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):
n = int(input())
a, b = map(int, input().split())
i = 0
ans = "NG"
while i <= b:
    if i >= a and i % n == 0:
        ans = "OK"
    i += n

print(ans)

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

for i in range(1000):
  if a <= k*i <= b:
    print("OK")
    exit()
  elif b < k*i:
    print("NG")
    exit()

Solution (Python):
K = int(input())
A, B = map(int, input().split())
ans = "NG"
if A % K == 0:
  ans = "OK"
elif B % K == 0:
  ans = "OK"
elif A // K != B // K:
  ans = "OK"
print(ans)

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

Solution (Python):

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):
K = int(input())
A,B = [int(i) for i in input().split()]
hi = range(A,B+1)
for i in hi:
  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):
    C = K * i
    if A <= C and C <= B:
        print('OK')
        exit()
    
print('NG')

Solution (Python):

import sys
from itertools import chain


def solve(K: int, A: int, B: int):
    n = (A + K - 1) // K
    l = n * K
    if l <= B:
        return "OK"
    return "NG"


def main():
    tokens = chain(*(line.split() for line in sys.stdin))
    K = int(next(tokens))  
    A = int(next(tokens))  
    B = int(next(tokens))  
    answer = solve(K, A, B)
    print(answer)


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

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

count = 0

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

if count == 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):
import sys

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

while l < a:
    l += k

while l <= b:
    ans += 1
    l += k

if ans == 0:
    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())

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

Solution (Python):
def main(K, A, B):
    for i in range(A, B+1):
        if i%K==0:
            print('OK')
            return
    print('NG')
    return

if __name__ == '__main__':
    K = int(input())
    A, B = map(int, input().split())
    main(K, A, B)

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


main()

Solution (Python):
K = int(input())
A, B = [int(v) for v 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(" "))
ngflag = True
while(a <= b):
    if a % k == 0:
        print("OK")
        ngflag = False
        break
    a += 1
if ngflag:
    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())

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

if x :
  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:
  print('OK')
elif a - a % k + k <= b:
  print('OK')
else:
  print('NG')

Solution (Python):
K = int(input())
A, B = map(int,input().split())
C = A % K
if B - A >= K - 1:
  print('OK')
elif C == 0:
  print('OK')
elif C + B - A >= K:
  print('OK')
else:
  print('NG')

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

x = (b // k) * k

if a <= x <= 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 b-a >= k:
		print("OK")
		break
	elif i % k == 0:
		print("OK")
		break
	elif (i % k != 0) and (i == b):
		print("NG")
		break

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

Solution (Python):
k = int(input())
a, b = [int(i) for i in 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())

check = False
for i in range(A, B+1):
  if i % K == 0:
    check = True
    
print("OK" if check 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())
x = 0

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

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

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

a, mod_a = divmod(A, K)
b, mod_b = divmod(B, K)

if mod_a == 0 or mod_b == 0:
    print('OK')
    exit()

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

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

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

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

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

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

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

amari =int(B/K)
if A<=K*amari and K*amari<=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())
 
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")
    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())

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):
def resolve():
    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 '__main__' == __name__:
    resolve()

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

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


if __name__ == '__main__':
    main()

Solution (Python):

K=int(input())
A, B=map(int,input().split())
Ans_list=[]
for i in range(A,B+1):
    if i%K==0:
        Ans_list.append(i)
if len(Ans_list)>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 = 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())
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 (b%k)*(a%k) == 0:
  print('OK')
else:
  print('NG')

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

    if B // K * K >= A:
        ans = "OK"
    else:
        ans = "NG"

    print(ans)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
k = int(input())
a, b = map(int, input().split())
if a == b == k:
    print('OK')
elif a == b and a % k == 0:
    print('OK')
else:
    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 ())
X = 'NG'
while A <= B:
  if A%K == 0:
    X = 'OK'
    break
  A += 1
print (X)

Solution (Python):
a=0
K=int(input())
A,B=map(int,input().split())
for i in range(1,1001):
    if A<=K*i<=B:
        a=1
        break
if a==0:
    print('NG')
else:
    print('OK')

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

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

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

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

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

Solution (Python):
import math
k = int(input())
a, b = list(map(int, input().split()))
mul = math.floor(b/k) * k

if(mul >= a and (mul >= a and mul <= 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())

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

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

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

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

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

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

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

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

Solution (Python):
K = int(input())
S = input().split()
A = int(S[0])
B = int(S[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(' '))
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 = 0
for i in range(A,B + 1,1):
	if i % K == 0:
		flag = 1

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

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

Solution (Python):
x = int(input())
a, b = map(int, input().split())
ans=0
for i in range(a,b+1):
  if i%x==0:
    ans=1
    break
if ans==1:
  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, 1):
    if i%k == 0:
        ans = 1
        break
if ans == 1:
    print("OK")
else:
    print("NG")

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    K=ii()
    A,B=mi()

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

    print("NG")





if __name__ == "__main__":
    main()

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

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

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

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

print('OK' if A<=(B-B%k) else 'NG')

Solution (Python):
from sys import stdin
rs = stdin.readline
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))

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

if __name__ == '__main__':
    main()

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

for a in range(A, B+1):
    if a % K == 0:
        print('OK')
        exit(0)
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'
print(ans)

Solution (Python):
k = int(input())
a,b = map(int,input().split())
f = 1
for i in range(a,b+1):
  if i % k == 0:
    print('OK')
    f = 0
    break
if f:
  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):
a = int(input())
b = list(map(int, input().split()))
if b[1]//a - (b[0]-1)//a >= 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 = 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')
    break
else:
  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())

i = 1
ans = "NG"
while k*i <= b:
    if a <= k*i:
        ans = "OK"
        break
    i += 1
print(ans)

Solution (Python):


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

c = int(b/k) - int((a-1)/k)

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

Solution (Python):
n=int(input())
x,y=map(int,input().split())
for i in range(x,y+1):
    if(i%n==0):
        print('OK')
        exit()
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):
def Qa():
    k = int(input())
    a, b = map(int, input().split())

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

if __name__ == '__main__':
    Qa()

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

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

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

if k == 1:
    print("OK")
else:
    if a % k == 0 or b % k == 0:
        print("OK")

    else:
        if a//k < b//k:
            print("OK")

        else:
            print("NG")

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

ans='OK'
if (A-0.1)//K == B//K :
    ans='NG'
    
print(ans)

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

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