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

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

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

Solution (Python):
k = int(input())
hoge = input().split()
A,B = int(hoge[0]), int(hoge[1])

ans = 0
huga = 0
for i in range(B):
  ans += k
  if A<=ans and ans <= B:
    huga = 1
    break

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

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

fl = False

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

if fl:
    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())

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

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

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

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

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

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")
    return


main()

Solution (Python):
import math
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())
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())

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

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

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*(b//k)>=a :
    print('OK')
else:
    print('NG')

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

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

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

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

print('NG')

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

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

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

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

ans = 'NG'
i = a
while i <= b:
    if i % k == 0:
        ans = 'OK'
        break
    i += 1


print(ans)

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

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

Solution (Python):
k = int(input())
a, b = map(int, input().split())
ans = False
for i in range(a, b+1):
    if i % k == 0:
        ans = True

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

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

if A%N == 0 or B%N == 0 :
    print("OK")
else :
    if ((A//N)+1)*N <= B :
        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
    break
    
if(flag == 1):
  print('OK')
else:
  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())


is_ok = False

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


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

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

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

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

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

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

answer="NG"

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

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

Solution (Python):
n = int(input())
s = list(map(int,input().split()))
if s[0]<=n*int(s[1]/n):
    print("OK")
else:
    print("NG")

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

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

print(solve())

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()
    print('NG')
    
if __name__ == '__main__':
    main()

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

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

Solution (Python):




def input_int():
    return int(input())



def int1(x):
    return int(x) - 1



def input_to_int_map():
    return map(int, input().split())



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    k = int(input())
    a, b = input_to_int_map()

    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 n in range(1000):
    if A <= n*K <= B:
        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()
    else:
        i+=1
print("NG")

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

Solution (Python):


import sys
input = sys.stdin.readline

N = int(input())
x,y = map(int,input().split())
for i in range(x,y+1):
    if i % N ==0:
        print('OK')
        sys.exit()
print('NG')

Solution (Python):


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

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    n = int(input())
    a,b = readInts()
    if a % n == 0 or a//n + 1 <= a//n + 1 <= b//n:
        print('OK')
    else:
        print('NG')
if __name__ == '__main__':
  main()

Solution (Python):


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

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

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

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

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

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

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

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

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

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

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

print(res)

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):
from math import sqrt,ceil



n=int(input())

a,b=map(int,input().split())
x=ceil(a/n)*n
if(x<=b):
    print("OK")
else:
    print("NG")

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

Solution (Python):
import sys
from math import sqrt
from collections import Counter, defaultdict, deque

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)


def I():
    return int(input())


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


def LI():
    return list(MI())


def LIN(n: int):
    return [I() for _ in range(n)]


inf = float("inf")
mod = 10 ** 9 + 7


def main():
    k = I()
    a, b = MI()

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

    print("NG")


if __name__ == "__main__":
    main()

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

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

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

for i in range(1,1001):
    if i >=a and i<=b and i%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())
if b//k*k>=a:
    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())

tmp1 = a // k
tmp2 = b // k
amari1 = a % k
amari2 = b % k

if amari1 == 0 or amari2 == 0:
    print('OK')
elif tmp1 != tmp2:
    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):
t=input()
a,b=map(int,raw_input().split())
f=0
for i in range(a,b+1):
    if i%t==0:
        f=1
        break

if f==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())

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

print(flag)

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

    k=int(input())
    a,b=map(int,input().split())
    if b//k-(a-1)//k!=0:
        print('OK')
    else:
        print('NG')

resolve()

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

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    K = int(input())
    A,B = map(int,input().split())
    l = A//K
    if K*l == A:
        print('OK')
    else:
        if K*(l+1)<=B:
            print('OK')
        else:
            print('NG')
if __name__ == "__main__":
    main()

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

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

Solution (Python):
K = int(input())
A, B = list(map(int, input().strip().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:
        ans = "OK"
        break
else:
    ans = "NG"
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(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 = [int(i) for i in input().split()]

flg=True
for i in range(A,B+1):
    if i%K==0:
        print("OK")
        flg=False
        break
if flg:
    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):
import sys,math,copy,queue,itertools,bisect,collections,heapq
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(-1,0),(0,1),(0,-1))

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

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

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

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

print('OK' if ans != 0 else 'NG')

Solution (Python):

import os
import sys
from io import BytesIO, IOBase


def main():
    k=int(input())
    l,r=map(int,input().split())
    l=(l-1)//k+1
    print("OK" if l*k<=r else "NG")



BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")


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

print('NG')

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

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

input = sys.stdin.buffer.readline


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

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

if cal(a, b, k):
    print ('OK')
else:
    print ('NG')

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

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

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

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

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

Solution (Python):

import sys
import numpy as np


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



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(K, A, B)

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

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

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

print("NG")

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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


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

    main(k, a, b)

Solution (Python):

K = int(input())

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

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

Solution (Python):
from __future__ import print_function

import sys
sys.setrecursionlimit(500000)

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


















def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


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

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

Solution (Python):
import sys
import math


def main():
    input = sys.stdin.readline
    k = int(input())
    a, b = (int(i) for i in input().split())
    res = False
    for i in range(a, b + 1):
        if i % k == 0:
            res = True

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


main()

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

result = "OK" if b//k - (a-1)//k >= 1 else "NG"

print(result)

Solution (Python):

k = int(input()) 
a,b = [int(s) for s in input().split()]
if a%k==0 or b%k==0 or (b//k)-(a//k)>0:
    print("OK")
else:
    print('NG')

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

print(m())

Solution (Python):
from collections import defaultdict,deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
    '''
    一つの整数
    '''
    return int(input())
def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


k = inp()
a, b = inpl()
if a%k==0 or 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(a, b+1):
    if i % k == 0:
        ans = "OK"

print(ans)

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

print(ans)

Solution (Python):
def main():

    from bisect import bisect_left as bl, bisect_right as br, insort
    import sys,heapq,math
    from collections import defaultdict as dd, deque
    def data(): return sys.stdin.readline().strip()
    def mdata(): return list(map(int, data().split()))
    out = sys.stdout.write
    
    INF = int(1e9)
    mod = int(1e9)+7

    k=int(data())
    a,b=mdata()
    if k*(b//k)>=a:
        print('OK')
    else:
        print("NG")



if __name__ == '__main__':
    main()

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

Solution (Python):


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

flag = 0
for i in range(A,B+1):
    if i % K == 0:
        flag = 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")
        exit()
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())

ans = "NG"
K = k
while 1:
    if K >= a and K <= b:
        ans = "OK"
        break
    if K > b:
        break
    K += k
print(ans)

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

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

Solution (Python):
import sys


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

    for i in range(A // K - 1, B // K + 1):
        if A <= K * i <= B:
            print('OK')
            sys.exit(0)

    print('NG')


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    k = int(input())
    a, b = map(int, input().split())
    ans = solve(k, a, b)
    print('OK' if ans else 'NG')


def solve(k, a, b):
    for i in range(a, b + 1):
        if not i% k:
            return True
    return False


if __name__ == '__main__':
    main()

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

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

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

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):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

K = int(readline().rstrip())
A, B = map(int, readline().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 = 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())
ans = 'NG'
for i in range(10000):
    if a <= k*i <= b:
        ans = 'OK'
print(ans)

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

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

print("NG")

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

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

print('NG')