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):
import numpy as np

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

x = np.array(list(range(a, b+1)))
x = x % k

if 0 in 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')
        break;

    if(i == B):
        print('NG')

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

Solution (Python):
c = int(input());
a, b = map(int, input().split())
d = 0;

while a <= b :
    if a % c == 0:
        d = d + 1;

    a = a + 1;
    
if d == 0:
    print("NG");

else:
    print("OK");

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
if flag:
    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")
    exit()
if int(A/K)<int(B/K):
    print("OK")
else:
    print("NG")

Solution (Python):










N = int(input()) 
arg = list(map(int, input().split())) 

A = arg[0]
B = arg[1]
flag = "NG"

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

print(flag)

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

p = 0
while 1:
    p += k
    if p >= a:
        if p <= b:
            print("OK")
        else:
            print("NG")
        exit()

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

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

result = 'OK'
if (A%K != 0)&(B%K != 0):
    A = A//K + 1
    B = B//K
    if B-A<0:
        result = 'NG'
        
print(result)

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

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

Solution (Python):
k = int(input())
aa = input().split()
aaa = aa[0]
bbb = aa[1]
a = int(aaa)
b = int(bbb)
l = 0
for i in range(a,b+1):
    if i % k == 0:
        print("OK")
        l = 1
        break
    else:
        continue
if l == 1:
    pass
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):
p=int(input())
n, k = map(int, input().split())
t=1
p2=0
while p2<k:
  p2=p*t
  if n<=p2 and p2<=k:
    print("OK")
    break
  t+=1
else:
  print("NG")

Solution (Python):

"""
@author: H_Hoshigi
"""
def main():
    K = int(input())
    A, B = map(int, input().split())
    answer = ""
    if A % K == 0:
        answer = "OK"
    elif (A//K + 1)*K <= B:
        answer = "OK"
    else:
        answer = "NG"
    print(answer)

if __name__ == "__main__":
    main()

Solution (Python):
import sys
k=int(input())
a,b=map(int, input().split())
if a==b:
  area=[a,b]
else:
  area=[int(i) for i in range(a,b+1)]

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

print('NG')

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

N = int(A / K)
mod = A % K
target = K * (N+1)

if(target <= B or mod == 0):
    print("OK")
else:
    print("NG")

Solution (Python):
import math

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

Solution (Python):
import sys
k = int(input())
a, b = map(int, input().split())
if k == 1:
    print('OK')
    sys.exit()
if a % k == 0 or b % k == 0:
    print('OK')
    sys.exit()

if (b // k) > (a // k):
    print('OK')
else:
    print('NG')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
i = 1
while k*i < a:
  i += 1
if k*i <= 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'

print(ans)

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

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 = False
i = a
while i <= b:
    if i % k == 0:
        flg = True
        break
    i += 1

if flg == True:
    print('OK')
else:
    print('NG')

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

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

Solution (Python):
import math
k = int(input())
a,b = map(int,input().split())
to = math.ceil(a/k)
print("OK" if ((k*to) >= a) and ((k*to) <= b) 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())
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 = map(int, input().split())
result = 'NG'
for i in range (A, B + 1):
    if i % K == 0:
        result = 'OK'
print(result)

Solution (Python):

"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""


"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""



"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""


"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""

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

Solution (Python):
K = int(input())
A,B = map(int,input().split())
x = int(A / K)
y = int(B / K)
x2 = A % K
y2 = B % K

if y == x and (x2 == 0 or y2 == 0):
    print('OK')
    exit()
if y != x or K == 1:
    print('OK')
else:
    print('NG')

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

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

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

Solution (Python):
def main():
    K = input()
    AB = input().split()
    A = int(AB[0])
    B = int(AB[1])
    K = int(K)
    count = 0
    for i in range((B // K)+1):
        if K * i >= A:
            print("OK")
            count = 1
            break
    if count == 0:
        print("NG")
    

if __name__ == "__main__":
    main()

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

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

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

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

first = A//K
first_a = A%K

if first_a == 0:
    if first*K <= B:
        print('OK')
        exit();
if (first+1)*K <= B:
    print('OK')
    exit();

print('NG')

Solution (Python):

import numpy as np

K = int(input())
a, b  = map(int, input().split())
array = np.linspace(a,b, (b - a + 1)).astype(int)
if np.any(array % K == 0):
    print("OK")
else:
    print("NG")

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

flag = False

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

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

for i in range(l[0], l[1]+2):
    if i == l[1]+1:
        print('NG')
        break
    if i % k == 0:
        print('OK')
        break

Solution (Python):
K = int(input())
A,B = map(int,input().split())
mes = 0
for num in range (A,B+1):
    if num % K == 0 : mes = 1
    else : pass

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

Solution (Python):
K = input()
min_val,max_val=input().split(' ')
if(int(K)==1):
    print('OK')
else:
    list_val=list(range(int(min_val),int(max_val)+1))
    list_val = list(map( lambda x:x%int(K),list_val))
    if (0 in list_val):
        print('OK')
    else:
        print('NG')

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

kk = k
ok = False
while not ok:
    if kk >= a and kk <= b:
        print("OK")
        ok = True
    if kk > b:
        print("NG")
        ok = True
    kk = kk + k

Solution (Python):

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

def amari(x,y):
    if x%y!=0:
        return 1
    else:
        return 0

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

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

flag=1
while(a<=b):
    if(a%k==0):
        print("OK")
        flag=0
        break
    a+=1
if(flag):
	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 = (int(x) for x in input().split())
i = 0
for i in range(k+1):
  if (a+i)%k == 0:
    print('OK')
    break
  elif a+i == b:
    print('NG')
    break
  elif i == k:
    print('NG')

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

while s <= B:
    count += 1
    s = K * count
    if(A <= s and s <= B):
        print('OK')
        break
    elif(s >= B):
        print('NG')
        break
    else:
        pass

Solution (Python):
k=int(input())
a,b = map(int, input().split())
c,d = divmod(a,k)
e,f = divmod(b,k)
if d == 0 or f == 0 or e-c > 0:
    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,1):
	if i%K==0:
		print('OK')
		break
	cnt+=1
if cnt==(B-A+1):
	print('NG')

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
printn = lambda x: print('\n'.join(x))

k = ni()
a, b = nm()
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())

ans = "NG"

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

print(ans)

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

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

for i in x:
  if i % K == 0:
    print('OK')
    break
  elif i == B:
    print('NG')
  else:
    pass

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

Solution (Python):

N = int(input())

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

a = int(A/N)
b = int(B/N)

if(b>a):
  print("OK")
elif(((B%N)==0)or((A%N)==0)):
  print("OK")
elif((b==0)or(a==0)):
  print("NG")
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())

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

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

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

k = int(k)
a = int(a)
b = int(b)
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())
'''

'''
'''
n = input()
a = [int(input()) for i in range(n)]
'''
'''
n,m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
'''



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

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

val1=(a-1)//k
val2=b//k

if(val1<val2):
    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
print('OK' if flag==1 else 'NG')

Solution (Python):
k = int(input(""))
ab, bc = input("").split()
a = int(ab)
b = int(bc)
present = 0
while a <= b:
    if a % k == 0:
        print("OK")
        present = 1
        break
    a += 1
if present == 0:
    print("NG")

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    K = int(input())
    A, B = map(int, input().split())
    OK = False
    for i in range(A,B+1):
        if i%K == 0:
            print("OK")
            OK = True
            break
    if OK == False:
        print("NG")

if __name__ == '__main__':
    main()

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

res = a/n

count = 0
for i in range(a,b+1):
  if int(res)*n == i or int(res+1)*(n) == i:
    print("OK")
    exit()
  else:
    count += 1

if count == (b-a+1):
  print("NG")

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

Solution (Python):
import math




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

a = math.ceil(A/K)

C = K * (a)


    


if C <= B:
    print ("OK")
else:
    print ("NG")

Solution (Python):
K = int(input())
input_AB = input().split(' ')
A = int(input_AB[0])
B = int(input_AB[1])
divA = A // K
divB = B // K

if divA != divB:
  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())
c = False
for i in range(a, b+1):
    if i%k == 0:
        print('OK')
        c = True
        break
if not c:
    print('NG')

Solution (Python):
import sys

k = int(input())
i = list(map(int, input().split()))
a = i[0]
b = i[1]
for j in range(a, b + 1):
  if j % k == 0:
    print("OK")
    sys.exit(0)
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
print("OK" if cnt>=1 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()
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")
		break
else:
	print("NG")

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

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

Solution (Python):
import math
bai = (int)(input())
min, max = map(int, input().split(" "))
for i in range((math.ceil)(min / bai) * bai, ((int)(max / bai) * bai) + 1):
    print("OK")
    break
else:
    print("NG")

Solution (Python):
K =int(input())
A,B =map(int,input().split())
for i in range(1,1000):
    if A <= K*i <=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, 1):
    if i % k == 0:
        print('OK')
        exit()
print('NG')

Solution (Python):
k=int(input())
a,b=map(int,input().split())
if(a%k==0 or b%k==0 or ((a//k)-(b//k))!=0):
  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:
        flag = 1
if flag == 1:
    print("OK")
else:
    print("NG")

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

nk = k

while True:
    if a <= nk <= b:
        print('OK')
        break
    elif b < nk:
        print('NG')
        break
    nk += k

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

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

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

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

i = 0
a = "NG"

while(K * i < B):
  i += 1
  if(A <= K * i and K * i <= B):
    a = "OK"

print(a)

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

if A <= K * b <= B:
  print('OK')
else:
  print('NG')

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

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

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

count=0

c=b-a

ans=0

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

if 0<ans:
    print('OK')

else:
    print('NG')

Solution (Python):
K = int(input())
A, B = map(int,input().split())
tmp = A//K
if A%K == 0:
  print("OK")
else:
  K_beta = K*(tmp+1)
  if A <= K_beta and K_beta <= B:
    print("OK")
  else:
    print("NG")

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

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

print('NG')

Solution (Python):
k = int(input())
r = input().split()
a = int(r[0])
b = int(r[1])

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

Solution (Python):
k=int(input())
a,b=[int(_) for _ in input().split()]
s=((a//k)+1)*k
if a%k==0 or s<=b:
    print('OK')
else:
    print('NG')

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

if A % K == 0:
    print("OK")
else:
    if K - (A % K) <= B - A:
        print("OK")
    else:
        print("NG")

Solution (Python):
t = int(input())
a = list(map(int, input().split()))
i = (a[0] // t) - 1
k = t
while k < a[0]:
    k = t * i
    i += 1
if a[0] <= k <= a[1]:
    print("OK")
else:
    print("NG")

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

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

if x - y >0:
    print('OK')
elif x - y == 0 :
    if A % k == 0 or B % k == 0:
        print('OK')
    else:
        print('NG')
else:
    print('NG')

Solution (Python):
K = int(input())
N, M = map(int, input().split())

if K == 1:
    print("OK")
    exit()

for i in range(N, M + 1):
    if (i / K).is_integer():
        print("OK")
        exit()


print("NG")

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

Solution (Python):
import math
k = int(input())
nums = [int(e) for e in input().split()]
a = nums[0]
b = nums[1]

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

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

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

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

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

Solution (Python):
k = int(input())
ab = input().split(' ')
a = int(ab[0])
b = int(ab[1])

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

Solution (Python):
import sys
k = int(input())
a, b = list(map(int, input().split()))
if a == b:
    if a%k == 0:
        print('OK')
    else:
        print('NG')
    sys.exit()
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(i) for i in input().split(" ")]

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

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

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

num = a / k
one_ = math.ceil(num)
if k == 1:
  print("OK")
else:
  if k * one_ <= b:
    print("OK")
  else:
    print("NG")

Solution (Python):
K = int(input())
A, B = map(int, input().split())
if A % K == 0 or ((A // K) * K + K <= B):
  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==1):
  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):
    if i % K == 0:
      print('OK')
      exit()
    else:
      pass

  print('NG')


if __name__ == "__main__":
  main()

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

Solution (Python):
K = int(input())
A,B= list(map(int,input().split()))
C=list(range(A,B+1))
i=0
while i<len(C):
  if C[i]%K==0:
    print("OK")
    break
  i+=1
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:
        print("OK")
        flag = True
        break

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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


def main():
    x = ((A - 1) // K + 1) * K
    ans = "OK" if x <= B else "NG"
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
k = int(input())
range_num = input().split(" ")
a = int(range_num[0])
b = int(range_num[1])
con1 = 1 <= a and a <= b and b <= 1000
con2 = 1 <= k and k <= 1000
count = 0
if con1 == True and con2 == True:
    b = b + 1
    for i in range (a, b):
        if i % k == 0:
            count = count + 1
        else:
            count = count
    if count > 0:
        print("OK")
    else:
        print("NG")
else:
    print()

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

Solution (Python):


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


if __name__ == "__main__":
    solve()

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

while A <= B:
    if A % K == 0:
        print("OK")
        break
    elif A == B:
        print("NG")
        break
    else:
        A += 1

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

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

Solution (Python):
n = int(input())
m = input().split()
a = int(m[0])
b = int(m[1])
 
if b//n - a//n >= 1:
    print('OK')
elif b%n == 0:
    print('OK')
elif a%n == 0:
    print('OK')
else :
    print('NG')

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

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

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

if __name__ == "__main__":
    main()

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

while True:
  k = temp
  k *= i
  if a <= k and b >= k:
    print('OK')
    break
  elif k > b:
    print('NG')
    break
  else:
    i += 1

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())
cnt = 0

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

if cnt > 0:
    print("OK")
else:
    print("NG")

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

Solution (Python):

K = int(input())
A, B = map(int, input().split(' '))
res = 'NG'
for c in range(A, B + 1):
    if not c % K: res = 'OK'
print(res)

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

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

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

while temp <= 1000:
    temp += K
    if A <= temp and temp <= B:
        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
  if i == B:
    print("NG")

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    K=I()
    a,b=MI()
    
    flag=0
    for i in range(a,b+1):
        if i%K==0:
            flag=1
    
    if flag==1:
        print("OK")
    else:
        print("NG")
    
main()

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

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

Solution (Python):
count = int(input())
line = input().split()
A = int(line[0])
B = int(line[1])
pivot = "NG"
lis = []
for i in range(A,B+1):
    lis.append(i)
    if i % count == 0:
        pivot = "OK"
        print(pivot)
        break
        
if pivot == "NG":
    print("NG")

Solution (Python):
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
Yes=lambda b:print("Yes"if b else"No");YES=lambda b:print("YES"if b else"NO")

def main():
  k=aint()
  a,b=ints()
  ans=False
  for i in range(a,b+1):
    if i%k==0:
      ans=True
      break
  print("OK"if ans else"NG")

if __name__ == '__main__':
    main()

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

c=a//K
d=b//K

if c-d==0 and a/K!=c:
	print("NG")
if a/K==c:
	print("OK")
if c<d:
	print("OK")

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

while k < a:
    k += n

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

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

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

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

if a[1]//k != a[0]//k:
  print('OK')
elif a[0]%k == 0:
  print('OK')
else:
  print('NG')

Solution (Python):
import math
K = int(input())
A, B = map(int, input().split())
a = math.ceil(A / K)
b = math.floor(B / K)
if b - a >= 0:
    print("OK")
else:
    print("NG")

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

x = 0
while x <= 1000:
    if A <= x <= B:
        print("OK")
        break
    x += K
else:
    print("NG")