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

Solution (Python):
import sys
from numba import njit
input = sys.stdin.buffer.readline

K = int(input())

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


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


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

Solution (Python):
import sys
from numba import njit
input = sys.stdin.buffer.readline

K = int(input())

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


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


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

Solution (Python):
import sys
input = sys.stdin.buffer.readline
 
 
def main():
    K = int(input())
    A, B = map(int, input().split())
    for i in range(A, B + 1):
        if i % K == 0:
            print('OK')
            sys.exit()
    print('NG')
 
 
if __name__ == '__main__':
    main()

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

K = int(input())

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


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


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

Solution (Python):
K = int(input())
k = K
A,B = map(int, input().split())
for i in range(1, B+1):
    k *= i
    if k >= A and k <= B:
        print('OK')
        a = True
        break
    else:
        k = K
        a = False
        continue
if a != True:
    print('NG')

Solution (Python):
K = int(input())
A, B = map(int, input().split())
count = 0
k = K
while k <= B:
  count += 1
  k = K * count
  if A <= k <= B:
    print('OK')
    break
else:
  print('NG')

Solution (Python):
def main():
    K = int(input())
    A, B = map(int, input().split())
    largest = B // K * K
    print("OK" if A <= largest else "NG")
    return


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

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

if m != 0:
    print("OK")
elif m == 0:
    print("NG")

Solution (Python):
K = int(input())
A,B = map(int,input().split())
judge = "NG"
if B-A >= B%K:
  judge = "OK"
print(judge)

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

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

ans = "NG"

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

print(ans)

Solution (Python):
x = int(input())
y, z = map(int,input().split())
i = 1
while x * i:
    if x * i > z:
        print("NG")
        exit()
    if y <= x * i <= z:
        print("OK")
        exit()
    i += 1

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

f=0
for x in range(A,B+1):
    f=f or (x%K==0)

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

Solution (Python):


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

for x in range(1000):
    if a <= x*k <= b:
        print('OK')
        break
else:
    print('NG')

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
    break;
if check == True:
  print('OK')
else:
  print('NG')

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

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

i = 1
while(True):
  if((A<=K*i) and (K*i<=B)):
    print('OK')
    sys.exit()
  if(B<K*i):
    print('NG')
    sys.exit()
  i += 1

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

for i in range(1001):
    if a <= k*i <=b:
        print('OK')
        exit(0)
print('NG')

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

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

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

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

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

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

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

print('NG')

Solution (Python):
a=int(input())
b,c=map(int,input().split())
d=c//a*a
if d>=b:
  print('OK')
else:
  print('NG')

Solution (Python):
K=input("")
N=input("")
N=N.split(" ")
A=N[0]
B=N[1]

i=int(A)

while i<=int(B):
    if i%int(K)==0:
        print("OK")
        break
    i+=1
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())
n,m=map(int,input().split())
f=0
for i in range(n,m+1):
    if i%k==0:
        f=1
if f==1:
    print('OK')
else:print('NG')

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

s=range(A,B+1)   
for n in range(1,1000):  
        if K*n in s:
            print("OK")
            break
        if K==1:
            print("OK")
            break
else:
    print("NG")

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

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

Solution (Python):

k = int(input())
a, b = map(int, input().split())
print(["NG", "OK"][b // k * k >= a])

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

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

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

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

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
        break
    else:
        pass

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

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

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

aa = a % k
bb = b % k

if(b - a >= k):
    print('OK')
elif(aa > bb):
    print('OK')
elif(aa == 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())

x = (a + k - 1) // k * k

if x <= b:
    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,1):
    if i % K == 0:
        res = "OK"
        break

print(res)

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

ARGS=input().split()
A=int(ARGS[0])
B=int(ARGS[1])

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

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

largest = int(b / k) * k

if( a <= largest ):
    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())
flg = False

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

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

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

    i = 1

    while k*i <= b:
        if a <= k*i <= b:
            print('OK')
            return
        i += 1
    else:
        print('NG')
resolve()

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

import numpy as np

k = int(input())
a, b = [int(x) for x in input().split()]
a_b = np.arange(a, b + 1)
ans = "OK" if (a_b % k == 0).any() else "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')
        break
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
  else:
    pass
if a != 0:
  print("OK")
else:
  print("NG")

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

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

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

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

Solution (Python):
k = int(input())
a, b = list(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())
listAtoB=list(range(A,B+1))
k=list(filter(lambda  x: x% K == 0,listAtoB))

if K==1 or len(k) >= 1:
	print("OK")
else:
	print("NG")

Solution (Python):


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

k = int(B/K) - int((A-1)/K) 

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

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

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

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

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

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

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

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

answer = 'NG'

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

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

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

Solution (Python):
k=int(input())
p=0
a,b=map(int,input().split())
list=list(range(a,b+1))
for val in list:
  if val%k==0:
    print('OK')
    p+=1
    break
  else:
    continue

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

Solution (Python):
k = int(input())
abs = [int(e) for e in input().split()]

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

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

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

Solution (Python):
K = int(input())
AB = input()
l = AB.split()
A = int(l[0])
B = int(l[1])
li = []
for i in range(A, B+1) : 
  if i % K == 0 :
    li.append(i)
  else :
    continue
if len(li) >=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")
    break
  if i == B:
    print("NG")

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

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

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

fly = range(A, B+1)

for i in fly:
  if i % K == 0:
    print('OK')
    break
else:
    print('NG')

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

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

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

main()

Solution (Python):
import sys











stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def main():
    k = int(stdin.readline().rstrip())
    a,b = map(int, stdin.readline().rstrip().split())
    
    
    
    
    
    for i in range(1,1000):
        if a<=k*i<=b:
            print("OK")
            exit()
    print("NG")

main()

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

Solution (Python):
K = int(input())
A,B = map(int,input().split(" "))
flag = 1
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())
ab=list(map(int, input().split()))
A=ab[0]
B=ab[1]
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())
A, B = map(int, input().split())

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

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    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__":
    setrecursionlimit(10000)
    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")
    break
else:
  print("NG")

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

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

Solution (Python):
K = int(input().rstrip())
A, B = map(int, input().rstrip().split())
v = int(B / K) * K
r = 'OK' if A <= v else 'NG'
print(r)

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

Solution (Python):
N=int(input())
A,B=list(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())

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

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

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

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

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

if A % K == 0 or B % K == 0:
    ans = "OK"
elif A//K != B//K:
    ans = "OK"
else:
    ans = "NG"

print(ans)

Solution (Python):
K = int(input())
A, B = [int(i) for i in input().split()]
C = B//K
if C*K >= A:
    print("OK")
else:
    print("NG")

Solution (Python):
K = int(input())
A,B = map(int,input().split())
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())
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):
if __name__ == '__main__':
    k = input()
    k = int(k)
    ab = input()
    ab = ab.split()
    a = int(ab[0])
    b = int(ab[1])
    flag = False
    sum = k
    while k<=b:
        if a<=k and k<=b:
            flag = True
        k += sum
    if flag:
        print("OK")
    else:
        print("NG")

Solution (Python):



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

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

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

Solution (Python):
def solve(string):
    k, a, b = map(int, string.split())
    return "OK" if b - a >= k or min(map(lambda x: x % k, range(a, b + 1))) == 0 else "NG"


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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

K = int(K)
AB = [int(i) for i in list(AB.split())]
x = AB[1]/K

if int(x) * K >= AB[0]:
  print('OK')
else:
  print('NG')

Solution (Python):
K=int(input())
a,b=map(int,input().split())
print("OK" if b%K<b-a+1 else "OK" if K==1 else "NG")

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

result = "NG"

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

print(result)

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
    i+=1

if (a==b and a%k==0):
        flg+=1

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

print("NG")

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


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

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

Solution (Python):
K = int(input())
A,B = map(int,input().split())
flag = False
x = 0
while True:
  if K*x > B:
    break
  if A <= K*x and B >= K*x:
    flag = True
  x += 1
if flag == True:
  print("OK")
else:
  print("NG")

Solution (Python):
import math
multiple = int(input())

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



if a % multiple == 0 :
    print("OK")
elif math.ceil(a / multiple ) * multiple <= b:
    print("OK")
else:
    print("NG")

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


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

    print("NG")


lovegolf(a,b,k)

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())
in1 = input().split(" ")
A = int(in1[0])
B = int(in1[1])
val = "NG"
for i in range(A,B+1):
    if i%K==0:
        val = "OK"
print (val)

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

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

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

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

Solution (Python):
K = int(input())
A, B = [int(a) for a in input().split()]
p = (A // K) * K
if (A <= p and p <= B) or (A <= p + K and p + K <= B):
    print("OK")
else:
    print("NG")

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

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

c = -(-a // k) * k
print('OK' if a <= c <= b else 'NG')

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

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

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


i = 1
while K * i <= 1000:
  if A <= K * i and K * i <= B:
    print("OK")
    exit()
  else:
    i+=1

print("NG")

Solution (Python):
K = int(input())
A, B = map(int, input().split())
A1 = int(A / K)
A2 = int(A % K)
B1 = int(B / K)

if (B1 - A1) >= 1 or A2 == 0:
  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 or B % K == 0:
        print("OK")
    else:
        print("NG")
elif A // K < B // K:
    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
print("NG" if count==0 else "OK")

Solution (Python):
import sys

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


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

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




for i in range(A,B+1,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())

largest = int(B/K) * K

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

print('NG')

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

Solution (Python):



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

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

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

ans = "NG"

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

print(ans)

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

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

print("NG")

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

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

if A == B:
    if A % K == 0:
        print('OK')

    elif B % K == 0:
        print('OK')

    else:
        print('NG')

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

    else:
        print('NG')

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


if __name__ == '__main__':
    main()

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

if (a//k < b//k) or (0 in [a%k, b%k]):
    print("OK")
else:
    print("NG")

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

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

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

Solution (Python):
import sys
K = int(input())
A, B = list(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())
d = K
while d <= B:
    if d >= A:
        print("OK")
        exit()
    d += K
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())

result = 'NG'
for i in range(1000):
  if A <= i*K <=B:
    result = 'OK'
    break
  elif B < i*K:
    break

print(result)

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

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

flag = False

for i in range(1,1000):
    n = i*k
    if n >= a and n <=b:
        flag =True
        break

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

Solution (Python):
def can(K,A,B):
    for n in range(1,1001):
        if n*K>=A and n*K<=B:
            return True
    return False

K = int(input())
A, B = map(int, input().split())
print("OK" if can(K,A,B) else "NG")

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


else:
    print('NG')

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

Solution (Python):
n = int(input())
s,d = map(int,input().split())

c = 0
for i in range(s,d+1):
  if i % n == 0:
  	c = c + 1
  else:
    c = c
    
if c != 0:
 	print("OK")
else:
  	print("NG")

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

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

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


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

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

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())
for i in (range(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()))

flg=False

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

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

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

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

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

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

c = b - a

d = b % k

if c >= d:
    print('OK')
else:
    print('NG')

Solution (Python):

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

maxbk = (B//K)*K

if maxbk >= A:
    print("OK")
else:
    print("NG")

Solution (Python):

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














maxbk = (B//K)*K

if maxbk >= A:
    print("OK")
else:
    print("NG")

Solution (Python):


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

a = A // K
b = B // K

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

    
print(ans)

Solution (Python):
K = int(input())
A, B = [int(x) for x in input().split()]
print("OK" if (B//K)*K >= A else "NG")