Problem:
 Score: 100 points    Problem Statement  Takahashi the Jumbo will practice golf.  His objective is to get a carry distance that is a multiple of K , while he can only make a carry distance of between A and B (inclusive).  If he can achieve the objective, print OK ; if he cannot, print NG .      Constraints   All values in input are integers.  1 \leq A \leq B \leq 1000  1 \leq K \leq 1000         Input  Input is given from Standard Input in the following format:  K  A  B       Output  If he can achieve the objective, print OK ; if he cannot, print NG .        Sample Input 1 7
500 600      Sample Output 1 OK  Among the multiples of 7 , for example, 567 lies between 500 and 600 .       Sample Input 2 4
5 7      Sample Output 2 NG  No multiple of 4 lies between 5 and 7 .       Sample Input 3 1
11 11      Sample Output 3 OK

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

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

Solution (Python):
import sys

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

y = x 
while y <= b:
	if y >= a:
		print("OK")
		exit()

	y += x

print("NG")

Solution (Python):
import math

i = int(input())
n, m = map(int, input().split(" "))

for s in range(n, m + 1):
    if s % i == 0:
        print("OK")
        exit()

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())
m = A//K if A%K!=0 else A//K-1
x = (m+1)*K
if A%K==0:
  print('OK')
elif x<=B:
  print('OK')
else:
  print('NG')

Solution (Python):
import sys
K = int(sys.stdin.readline())
A, B = map(int, sys.stdin.readline().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 = A//K
if A%K!=0:
    a+=1
if a*K>=A and a*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')
        break
else: print('NG')

Solution (Python):

import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache

readline=sys.stdin.readline
sys.setrecursionlimit(2000)

alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)

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

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

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

def solve():
    for i in (range(10000)):
        tmp = k * i
        if (a <= tmp and tmp <= b):
            return True

    return False

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

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

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

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

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

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

print('NG')

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

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 itertools
import math
import string
import collections
from collections import Counter
from collections import deque
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
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())
for a in range(A, B+1):
    if a % K == 0:
        print("OK")
        exit()
    
print("NG")

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


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)


def main():
    K = int(input())
    A, B = map(int, input().split())
    if A % K == 0:
        print("OK")
    elif B // K == A // K:
        print("NG")
    else:
        print("OK")


if __name__ == "__main__":
    main()

Solution (Python):
def solve(k, a, b):
    for x in range(a, b+1):
        if x % k == 0:
            return True
    return False


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

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


def get_nums_l():
    return [ int(s) for s in input().split(" ")]

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

MOD = 10**9+7

k= int(input())
a,b = get_nums_l()

print("OK" if a%k==0 or b-a+1 > k or a%k>b%k else "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')
    return 
    


if __name__ == '__main__':
    main()

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

print(ans)

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

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

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

Solution (Python):


k = int(input())
a, b = map(int,input().split())
flg = False
for i in range(1001):
    if a<=k*i<=b:
        flg = True
    
if flg:
    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):
k = int(input())
a,b = map(int,input().split())
flag = True
for i in range(a,b+1):
    if i%k == 0:
        flag = False
        break
if flag == True:
    print("NG")
else:
    print("OK")

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

c = k
while c <= b:
    if a <= c:
        print('OK')
        exit(0)
    c += k
print('NG')

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

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

Solution (Python):
import sys


try:
    sys.stdin = open(sys.path[0] + '\\input.txt', 'r')
    sys.stdout = open(sys.path[0] + '\\output.txt', 'w')
except FileNotFoundError:
    pass


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

lower = k * int(a // k)
if lower < a:
    lower += k

if lower <= b:
    print('OK')
else:
    print('NG')

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

a = A//K
b = B//K
c = A%K
d = B%K

if a == b:
    if c == 0 or d == 0:
        print('OK')
    else:
        print('NG')
else:
    print('OK')

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

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

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

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

Solution (Python):
def resolve():
    '''
    code here
    '''
    K = int(input())
    A, B = [int(item) for item in input().split()]

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

if __name__ == "__main__":
    resolve()

Solution (Python):
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
from math import ceil, floor
import numpy as np
from collections import defaultdict, deque,Counter
from operator import itemgetter
from bisect import bisect_left, bisect_right, insort_left, insort_right
import sys
input = sys.stdin.readline





def main():
    k = int(input())
    a, b = map(int, input().split())
    flag = False
    for i in range(1000):
        if a <= k * i <= b:
            flag = True
    if flag:
        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())

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)  
to_index = lambda x: int(x) - 1  
print_list_in_2D = lambda x: print(*x, sep="\n")  


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

def map_int_input():
    return map(int, input())

MII = map_int_input

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

def MII_to_index():
    return map(to_index, input())

def MII_split_to_index():
    return map(to_index, input().split())


def list_int_inputs():
    return list(map(int, input()))

LII = list_int_inputs

def LII_split():
    return list(map(int, input().split()))


def LII_2D(rows_number):
    return [LII() for _ in range(rows_number)]

def LII_split_2D(rows_number):
    return [LII_split() for _ in range(rows_number)]

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

Solution (Python):
import math
import fractions
import collections
import itertools
K=int(input())
A,B=map(int,input().split())
flag=0
for i in range(A,B+1,1):
    if i%K==0:
        flag=1
if flag==1:
    print("OK")
else:
    print("NG")

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

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

if det == 1:
    print("OK")

else:
    print("NG")

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



m=0
for i in range(a,b+1):
    if i//n==i/n:
        m+=1
if m>0:
    print("OK")
else:
    print("NG")

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

ans = "NG"

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

print(ans)

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

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

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

Solution (Python):
k = int(input())
a,b=list(map(int,input().split()))
for i in range(251):
    if a<=k*i<=b:
        print('OK')
        exit()
print('NG')

Solution (Python):

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



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

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

ans = 'NG'

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

print(ans)

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

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

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

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys

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

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

if (A // K + 1) * K <= B or 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):


from pprint import pprint
from collections import deque, defaultdict
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.buffer.readline
INF = float("inf")

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

res = 0
flag = False
while res <= b:
    res += k
    if a <= res <= b:
        flag = True

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

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

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

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):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

Solution (Python):
inf = 10**15
mod = 10**9+7
k = int(input())
a,b = map(int, input().split())
tmp = a//k
if tmp*k == a:
    print('OK')
elif (tmp+1)*k <= b:
    print('OK')
else:
    print('NG')

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

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

print(ans)

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

Solution (Python):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

K = INT()
A, B = MAP()

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 numpy as np
if __name__ == "__main__":
    
    
    
    k = int(input())
    a, b = map(int, input().split())
    ans = 'NG'
    for i in range(a, b+1):
        if i % k == 0:
            ans = 'OK'
            break
    print(ans)

Solution (Python):
K=int(input())
A,B=map(int,input().split())
for i in range(10000):
	if K*i>=A and K*i<=B:
		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
print('OK' if flag else '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):
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))



K=one_int()
A,B=many_int()

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

Solution (Python):
import sys

k = int(input())

a,b= (int(i) for i 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())

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

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

Solution (Python):
import itertools
import math
import numpy as np
import fractions
from collections import deque
from itertools import combinations
from functools import reduce
from functools import lru_cache
import bisect
import sys
sys.setrecursionlimit(10**9)

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

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


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





if __name__ == "__main__":
  main()

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

Solution (Python):
k = int(input())
a,b = map(int,input().split())
c = []
for i in range(1200):
    c.append(k*i)
    
import sys
    
for i in c:
    if a <= i and i <= b:
        print("OK")
        sys.exit()
        
print("NG")

Solution (Python):
import math

flag = 1

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

if flag:
    print("NG")

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

x = b//k

print('OK' if x*k >= a else '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
if ok == 0: print("NG")
else : print("OK")

Solution (Python):
k = int(input())
a,b=map(int, input().split())
c=b//k
d = k*c
if a <= d:
    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 and i % K == 0:
        ans = "OK"
        break

print(ans)

Solution (Python):

import sys
input = sys.stdin.buffer.readline


from collections import defaultdict

con = 10 ** 9 + 7

def getlist():
	return list(map(int, input().split()))


def main():
	K = int(input())
	A, B = getlist()
	for i in range(1001):
		if A <= K * i and K * i <= B:
			print("OK")
			return

	print("NG")
	


if __name__ == '__main__':
	main()

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

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

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

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

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

Solution (Python):

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

    n += 1

print("NG")

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

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

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:
            ans = 'OK'
            break
    else:
        ans = 'NG'

    print(ans)

if __name__ == '__main__':
    main()

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

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

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

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

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

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

for i in range(1000):
    tmp = K * i
    if A <= tmp <= B:
        print('OK')
        exit()

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

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

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

for i in range(n,m+1):
    if i%a==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):
def main():
    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')

main()

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

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

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

Solution (Python):
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7

K = INT()
A, B = MAP()
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())

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

print(ans)

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

import sys

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

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


def main():
     k=int(input())
     a,b = map(int,input().split())
     for x in range(a,b+1):
          if x%k==0:
               print("OK")
               return
     print("NG")
                    
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())

count = 0

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

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

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

import sys


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

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

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

print(ans)

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

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