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

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

Solution (Python):
k = int(input())
s = list(map(int, input().split()))
a = s[0]
b = s[1]
flg = 0
for num in range(a,b+1):
    if(num%k == 0):
        flg = 1
        break
if flg == 1:
    print("OK")
else:
    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):
K = int(input())
A, B = map(int, input().split())
if A % K == 0 or B % 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"
    break
print(ans)

Solution (Python):
def validate(A, B, K):
    for n in range(A, B + 1):
        if n % K == 0:
            return True
    return False


def main():
    K = int(input())
    A, B = list(map(int, input().split(' ')))
    if validate(A, B, K):
        print('OK')
    else:
        print('NG')


if __name__ == '__main__':
    main()

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

list_ab = [i for i in range(a,b+1)]
ans = 'NG'

for j in range(len(list_ab)):
  if list_ab[j] % k ==0:
    ans = 'OK'
    break

print(ans)

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

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

Solution (Python):
from sys import stdin
import math
import fractions

k = int(stdin.readline().rstrip())
a, b = [int(x) for x in stdin.readline().rstrip().split()]

result = 0
flag = False
for i in range(10000):
    result += k
    if (a <= result and b >= result):
        print('OK')
        flag = True
        break

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

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

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

Solution (Python):
K = int(input())
A, B = map(int, input().split())
A_shou = A // K
B_shou = B // K
if (A_shou != B_shou) or (A % K == 0):
    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
    if i==b:
        print("NG")

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

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

MOD = 10 ** 9 + 7

def main():
    for _ in inputt(1):
        k, = inputi()
        a, b = inputi()
        if b // k - (a - 1) // k > 0:
            print("OK")
        else:
            print("NG")









from math import *
from heapq import *
from itertools import *
from functools import reduce, lru_cache, partial
from collections import Counter, defaultdict
import re, copy, operator, cmath
import sys, io, os, builtins
sys.setrecursionlimit(1000)





BUFSIZE = 8192
class FastIO(io.IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = io.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(io.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")
def print(*args, **kwargs):
    if args:
        sys.stdout.write(str(args[0]))
        split = kwargs.pop("split", " ")
        for arg in args[1:]:
            sys.stdout.write(split)
            sys.stdout.write(str(arg))
    sys.stdout.write(kwargs.pop("end", "\n"))
def debug(*args, **kwargs):
    print("debug", *args, **kwargs)
    sys.stdout.flush()
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip()
inputt = lambda t = 0: range(t) if t else range(int(input()))
inputs = lambda: input().split()
inputi = lambda k = int: map(k, inputs())
inputl = lambda t = 0, k = lambda: list(inputi()): [k() for _ in range(t)] if t else list(k())





def len(a):
    if isinstance(a, range):
        return -((a.start - a.stop) // a.step)
    return builtins.len(a)
def bisect_left(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if key(a[mid]) < x: lo = mid + 1
        else: hi = mid
    return lo
def bisect_right(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if x < key(a[mid]): hi = mid
        else: lo = mid + 1
    return lo
def insort_left(a, x, key = None, lo = 0, hi = None):
    lo = bisect_left(a, x, key, lo, hi)
    a.insert(lo, x)
def insort_right(a, x, key = None, lo = 0, hi = None):
    lo = bisect_right(a, x, key, lo, hi)
    a.insert(lo, x)
do_nothing = lambda x: x
bisect = bisect_right
insort = insort_right
def index(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi and key(a[i]) == x: return a[i]
    if default != None: return default
    raise ValueError
def find_lt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_le(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_gt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError
def find_ge(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError






class Tree:
    def __init__(n):
        self._n = n
        self._conn = [[] for _ in range(n)]
        self._list = [0] * n
    def connect(a, b):
        pass





class Sieve:
    def __init__(self):
        self._n = 6
        self._list = [2, 3, 5, 7, 11, 13]
    def extend(self, n):
        if n <= self._list[-1]: return
        maxbase = int(n ** 0.5) + 1
        self.extend(maxbase)
        begin = self._list[-1] + 1
        newsieve = [i for i in range(begin, n + 1)]
        for p in self.primerange(2, maxbase):
            for i in range(-begin % p, len(newsieve), p):
                newsieve[i] = 0
        self._list.extend([x for x in newsieve if x])
    def extend_to_no(self, i):
        while len(self._list) < i: 
            self.extend(int(self._list[-1] * 1.5))
    def primerange(self, a, b):
        a = max(2, a)
        if a >= b: return
        self.extend(b)
        i = self.search(a)[1]
        maxi = len(self._list) + 1
        while i < maxi:
            p = self._list[i - 1]
            if p < b:
                yield p
                i += 1
            else: return
    def search(self, n):
        if n < 2: raise ValueError
        if n > self._list[-1]: self.extend(n)
        b = bisect(self._list, n)
        if self._list[b - 1] == n: return b, b
        else: return b, b + 1
    def __contains__(self, n):
        if n < 2: raise ValueError
        if not n % 2: return n == 2
        a, b = self.search(n)
        return a == b
    def __getitem__(self, n):
        if isinstance(n, slice):
            self.extend_to_no(n.stop + 1)
            return self._list[n.start: n.stop: n.step]
        else:
            self.extend_to_no(n + 1)
            return self._list[n]

sieve = Sieve()
def isprime(n):
    if n <= sieve._list[-1]:
        return n in sieve
    for i in sieve:
        if not n % i: return False
        if n < i * i: return True
prime = sieve.__getitem__
primerange = lambda a, b = 0: sieve.primerange(a, b) if b else sieve.primerange(2, a)
def factorint(n):
    factors = []
    for i in sieve:
        if n < i * i: break
        while not n % i:
            factors.append(i)
            n //= i
    if n != 1: factors.append(n)
    return factors
factordict = lambda n: Counter(factorint(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 = list(map(int, input().split(" ")))

a_r = a % k
a_m = a // k
b_r = b % k
b_m = b // k

if (a_m != b_m) or (a_r == 0) or (b_r == 0):
    print('OK')
else:
    print('NG')

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

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

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

KA = A / K
KB = B / K
if KB >= ceil(KA):
    print("OK")
else:
    print("NG")

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

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

ap = a//k
aq = a%k
bp = b//k

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

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")
            break;
    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
    
if flg:
    print('OK')
else:
    print('NG')

Solution (Python):
K = int(input())
il2 = [int(k) for k in input().split()]
A = il2[0]
B = il2[1]

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

Solution (Python):
import sys

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

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

print('NG')

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

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

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

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

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

c = 'NG'
for i in range(b-a+1):
  d = a + i
  if d % n == 0:
    c = 'OK'
    
  
print(c)

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

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

c=b//N
if N*c>=a :
    print('OK')
else:
    print("NG")

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

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

print(ans)

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

Solution (Python):
k = int(input())
lis = [k*i for i in range(1,1001)]
a,b = map(int,input().split())
flag=0
for i in lis:
    if(a<=i and i<=b):
        flag=1
        break
if(flag):
    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
if c > 0:
    print("OK")
else:
    print("NG")

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

k = int(input())
n, m = map(int, input().split())

if n%k==0:
    print('OK')
    exit()

if m%k==0:
    print('OK')
    exit()

mm= m//k
nn= n//k

if mm>nn:
    print('OK')
else:
    print('NG')

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):

"""
=int(input())
=map(int,input().split())
=list(map(int,input().split()))








lis=[[] for _ in range(M)]
for i in range(M):
    lis[i] = list(map(int,input().split()[0:]))


N = int(input())
a = [0] * N
b = [0] * N
c = [0] * N
for i in range(N):
    a[i], b[i], c[i] = map(int, input().split())
"""

k=int(input())
a,b=map(int,input().split())
lis=list(range(a,b+1))
for i in range(len(lis)):
    if lis[i]/k==int(lis[i]/k):
        print('OK')
        break
else:
    print('NG')

Solution (Python):




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

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


if __name__ == '__main__':
    main()

Solution (Python):
if __name__ == '__main__':
    a = int(input())
    b, c = map(int, input().split())
    i =0
    j = 0
    flag = 0
    while j <=c:
        i +=1
        j = a *i
        if j >=b and j<= c :
            flag = 1

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

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


result = "NG"
for i in range(args[0], args[1] + 1):
    if i % a == 0:
        result = "OK"



print(result)

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

a_sho = a // k
b_sho = b // k
a_mod = a % k

if a_sho == b_sho and a_mod != 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")
    exit(0)
if A//K-B//K==0:
    print("NG")
else:
    print("OK")

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):
import sys
K = int(input())
A, B = map(int, input().split())
i = 1
while K*i <= B:
    if A <= K*i <= B:
        print('OK')
        sys.exit()
    i += 1
print('NG')

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

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

Solution (Python):


from sys import stdin


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

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


if __name__ == "__main__":
    main()

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


print(ans)

Solution (Python):

import sys
import math
import numpy as np
import itertools


n = int(input())


a, b = (int(i) for i in input().split())

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

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

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

i = 1
flag = 0
while i <=1000:
    if int(A)<= K*i <= int(B):
        print("OK")
        flag = 1
        break
    
    i +=1
    

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

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

print("OK" if judge == 1 else "NG")

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

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

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

if n * math.ceil(a/n)<= b:
    print('OK')
else:
    print('NG')

Solution (Python):
k=int(input())
a,b=map(int, input().split())
c=0
for i in range(1,10000):
    if a<=k*i and k*i<=b:
        c=1
        break
    else:
        c=0
print('OK') if c==1 else print('NG')

Solution (Python):
K = int(input())
N = [int(e) for e in input().split()]
for i in range(N[0],N[1]+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 <= b-a:
    print("OK")
else:
    print("NG")

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

N = A %K
if N == 0:
    print('OK')
else:
    N = K-N
    N = A+N
    if N > B:
        print('NG')
    else:
        print('OK')

Solution (Python):
k = int(input())
a, b = map(int, input().split())
print('NOGK'[(a - 1) // k < b // k::2])

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import collections

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

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

K = int(input())
A, B = LI()

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

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

Solution (Python):


import sys
readline = sys.stdin.readline
read = sys.stdin.read


k,a,b = [int(i) for i in read().split()]

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

print(ans)

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

for i in range(1, 1001):
    n = i * k
    if n > b:
        break
    if a <= n <= b:
        print("OK")
        quit()
print("NG")

Solution (Python):


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

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

if __name__ == "__main__":
    main()

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

dist = A % K + B - A

if dist >= K :
  print("OK")
elif A % K == 0 or B % K == 0:
  print("OK")
else :
  print("NG")

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
k = int(input())
a, b = map(int, input().split())
cnt = 0
for ind in range(1000):
    if a <= cnt <= b:
        print("OK")
        exit()
    cnt += k
print("NG")

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

def main():
    K = int(input())
    A, B = map(int, input().split())
    for i in range(1001):
        if A <= (i*K) <= B:
            print('OK')
            return
    print('NG')

if __name__ == '__main__':
    main()

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):

import sys


def solve(K: int, A: int, B: int):
    k = B // K
    if A <= k * K:
        print("OK")
    else:
        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):
import sys
K = int(input())
A, B = map(int, input().split())

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

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

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

if len(l) > 0:
    print("OK")
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:
        print("OK")
        f+=1
        break
if f==0:
    print("NG")

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

while True:
    if A <= K*i <= B:
        print("OK")
        break
    elif K*i > B:
        print("NG")
        break
    else:
        i += 1

Solution (Python):
K = int(input())
A, B = (int(x) for x in input().split())
c = 0
for i in range(0, int(B/K)+1):
    if K * i >= A and K * i <= B:
        c += 1
if c > 0:
    print('OK')
else:
    print('NG')

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

b,c=list(map(int,input().split()))

k=b//a
s=b%a

if s==0:
  print("OK")
else:
  if (k+1)*a <= c:
    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.readline


A = int(input())


X,Y = map(int,input().split())

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

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

judge= [i for i in range(A, B+1) if i % K == 0]

if len(judge) >= 1:
    print('OK')
else:
    print('NG')

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

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

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

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

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

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

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

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

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

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

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

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

if N//K < M//K:
    print('OK')
elif N%K == 0 or M%K == 0:
    print('OK')
else:
    print('NG')

Solution (Python):
def abc165_a():
  k = int(input())
  a, b = map(int, input().split())
  for i in range(1, 1001):
    if a <= i * k and i * k <= b:
      print('OK')
      return
  print('NG')

abc165_a()

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

target = a
res = 'NG'
while target <= b:
    if target % k == 0:
        res = 'OK'
    target += 1
print(res)

Solution (Python):









import os
import sys


def main():
    k=int(input())
    a,b=map(int,input().split())
    amari=a%k
    shou=a//k
    if amari==0:
        print("OK")
        return
    if (shou+1)*k <= b:
        print("OK")
        return
    print("NG")

if __name__ == "__main__":
    main()

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