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())
def f():
    if A % K == 0:
        return 'OK'
    out = (A // K) * K + K
    if out <= B:
        return 'OK'
    else:
        return 'NG'

print(f())

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

Solution (Python):
K = int(input())
A,B = (int(x) for x in input().split())
Flag = 0
for T in range(0,B-A+1):
    if (A+T)%K==0:
        Flag = 1
        break
if Flag:
    print('OK')
else:
    print('NG')

Solution (Python):
k=int(input())
a,b=map(int,input().split())
if a<k and b<k:
    print('NG')
else:
    print('NOGK'[(a//k!=b//k or a%k==0)::2] if a!=b else 'OK')

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

adiv =a//k


if k*(adiv+1)<=b:
   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(a, b+1):
    if i % k == 0:
        print('OK')
        exit()
print('NG')

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

Solution (Python):
K = int(input())
A, B =map(int,input().split())
ad,am=divmod(A,K)
bd,bm=divmod(B,K)
if bd>ad:
    print("OK")
elif am ==0:
    print("OK")
else:
    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

if ans != "OK":
    ans = "NG"

print(ans)

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

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

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

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

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

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

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

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

upper_times_k = (b // k) * k

if a <= upper_times_k:
  print('OK')
else:
  print('NG')

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

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

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

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

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


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

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

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

Solution (Python):
K = int(input())
S = input().split()
A = int(S[0])
B = int(S[1])
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())

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

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

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

remain = A % K

if (remain == 0) or (A + (K- remain) <= B):
  print('OK')
else:
  print('NG')

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

c = B//K
if c * K >= A:
  print('OK')
else:    
  print('NG')

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

j = b - i

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

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

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

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

flag = 0
i = 1
while flag == 0:
    if k * i <= b:
        if a <= k * i <= b:
            flag = 1
        i = i + 1
    else:
        break

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

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

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

Solution (Python):
k,a,b=map(int,open(0).read().split())
print('ONKG'[b%k>b-a::2])

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


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

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

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

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

flag=False

for i in range(A,B+1):
  if i%K==0:
    flag=True
  else:
    continue

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

Solution (Python):
k=int(input())
a,b=map(lambda x:int(x),input().split())
if a%k==0 or b%k==0:
  print('OK')
elif int(a/k)+1<=b/k or a<=int(b/k)-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')
            return
    print('NG')


if __name__=="__main__":
    main()

Solution (Python):

K = int(input())
A,B = map(int,input().split())
a = A//K
b = B//K
if 1 <= b and a != b or A%K == 0:
    print("OK")
else:
    print("NG")

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

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

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


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

print('NG')

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

if A%K == 0:
    print("OK")
    sys.exit()
if A + (K - A%K) <= B:
    print("OK")
else:
    print('NG')

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

Solution (Python):
k=int(input())
x=input()
x0=x.split()
a=int(x0[0])
b=int(x0[1])
q=0
for i in range(a,b+1):
    if i%k==0:
        q=1
if q==1:
    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())
if A % K == 0:
    print("OK")
elif (A // K + 1) * K <= B:
    print("OK")
else:
    print("NG")

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

Solution (Python):
K = int(input())
l, h = map(int, input().split(' '))

for n in range(l, h + 1):
    if n % K == 0:
        print('OK')
        break
else:
    print('NG')

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

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

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

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


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

Solution (Python):
import sys

K = int(input())
A,B = map(int,input().split())
n = K
i = 1
while n <= B:
    if A <= n and n <= B:
        print("OK")
        sys.exit()
    i += 1
    n = K * i

print("NG")

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

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

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

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

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

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

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

cnt = b//k - (a - 1)//k

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

multiple = 0

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

if multiple == 1:
    print('OK')
elif multiple == 0:
    print('NG')

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

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

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

Solution (Python):
def main():
  k=int(input())
  a,b = list(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")

main()

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

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

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

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

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

Solution (Python):

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

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

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

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

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

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

    res = 'NG'
    for i in range(A//K, B+1):
        if K*i >= A and K*i<=B:
            res = 'OK'
            break
    print(res)            



if __name__ == '__main__':
    main()

Solution (Python):
k = int(input())
a, b = map(int, input().split())
ka = a // k
kb = b // k
if b - a >= k - 1:
  print("OK")
elif kb - ka > 0:
  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())
bb = b//k
aa , i = divmod(a, k)
if (aa != bb) or ( i ==0):
    print("OK")
else:
    print("NG")

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

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

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

NUM = 0

while 1:
    NUM += K
    if NUM >= A:
        break

if NUM <= B:
    print('OK')
else:
    print('NG')

Solution (Python):


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

p = 0

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

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

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

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

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

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

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

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

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

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

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

ans='NG'

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

print(ans)

Solution (Python):
k=int(input())
l=list(map(int, input().split(' ')))
a=l[0]
b=l[1]

if (b-a)+1>=k:
    print('OK')
else:
    maybe=(a//k)*k
    ans=False
    while maybe<=b:
        if maybe>=a:
            ans=True
            break
        else:
            maybe+=k
    if ans:
        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
    elif i == 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())
m = int(b/k)

for i in range(m):
  if a<=k*(i+1) and b>=k*(i+1):
    print('OK')
    exit()
  else:
    i += 1

print('NG')

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

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

warikiretakadouka = False

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

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

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

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

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

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

print('OK') if (A + K - 1) // K * K <= B 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'
        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())

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

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

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

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

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

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

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

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

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

for i in range(1001):
    if i * k >= a and i*k <= b:
        result = "OK"
        break
print(result)

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):
n = int(input())
a,b = map(int,input().split())
if b//n - (a-1)//n >0:
  print("OK")
else:
  print("NG")

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

t = 0
while t <= b:
    t += k
    if a <= t <= b:
        ans = "OK"

print(ans)

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

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

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

flg=False

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

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

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

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

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

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

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

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

if check(K, A, 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:
        print("OK")
        c=1
        break
if c==0:
    print("NG")

Solution (Python):
k, a, b = map(int, open(0).read().split())
print("NOGK"[a//k < b//k or a//k == a/k::2])

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

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

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

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

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

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

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

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

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

if(A%K==0 or B%K==0):
    print('OK')
elif(B-A >= K - 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:
    print("OK")
else:
    print("NG")

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

i = a // k
j = b // k

res = j - i

if res >= 1:
  print('OK')
elif res == 0 and k == 1:
  print('OK')
elif a%k ==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 == 0):
    Flag = True

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

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

print('OK' if B - B%K >= A else 'NG')

Solution (Python):
def main():
	K = int(input())
	AB = list(map(int,input().split()))
	A = 0
	for i in range(AB[0],(AB[1]+1)):
		if(i%K==0):
			A += 1
	if(A>0):
		return(print("OK"))
	
	return(print("NG"))
      
      

    
main()

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

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

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

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

clear = []

for target in range (A,B+1):
    if target % K == 0:
        clear.append(target)
        
if not clear:
    print("NG")
else:
    print("OK")

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

dist_string = input()
l = dist_string.split()
a = int(l[0])
b = int(l[1])

counter = 0

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

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

Solution (Python):
k = int(input())
combined = input().split(" ")
a = int(combined[0])
b = int(combined[1])
result = False

while True:
    if a % k == 0:
        result = True
        break
    if a == b:
        break
    a += 1

if result:
    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())
flag = False
i = A
while(i<=B):
  if i%K==0:
    flag=True
    break
  i +=1
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')
        quit()

print('NG')

Solution (Python):
import sys
from collections import deque
import copy
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()
    print('NG')


if __name__ == '__main__':
    main()

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

for i in range(from_A, to_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:
  print("OK")
else:
  print("NG")

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

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

Solution (Python):
def main():
    k = int(input())
    a, b = [int(i) for i in input().split()]
    if a % k == 0:
        print('OK')
        exit()
    if b % k == 0:
        print('OK')
        exit()
    if b // k > a // k:
        print('OK')
    else:
        print('NG')

if __name__ == '__main__':
    main()

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

Solution (Python):
K = int(input())
A, B = map(int, input().split())
cnt = 0
while K * cnt <= 1000:
    if A <= K * cnt <= B:
        print('OK')
        exit()
    cnt += 1
print('NG')

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

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

Solution (Python):
import sys

from numba import njit, b1, i8


@njit(b1(i8, i8, i8), cache=True)
def solve(K, A, B):
    for i in range(A, B + 1):
        if i % K == 0:
            return True
    return False


def main():
    input = sys.stdin.buffer.readline
    K = int(input())
    A, B = map(int, input().split())

    print('OK' if solve(K, A, B) else 'NG')


if __name__ == '__main__':
    main()

Solution (Python):
import sys

from numba import njit, void, i8
input = sys.stdin.buffer.readline
K = int(input())
A, B = map(int, input().split())


@njit(i8(i8, i8, i8), cache=True)
def main(K, A, B):

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


if __name__ == '__main__':
    main(K, A, B)