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):
N = int(input())
hani = input().split(" ")
a = "NG"
for i in range(int(hani[0]), int(hani[1]) + 1):
  if i % N == 0:
    a = "OK"
    break
print(a)

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

ans = "NG"

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

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

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

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

wari = int(a/k)
amari = a%k
if amari > 0 and b < (wari+1) * k:
  print('NG')
else:
  print('OK')

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

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


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

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

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

Solution (Python):


k, a, b = [0] * 3

def format_input(filename = None):
	global k, a, b
	if filename == None:
		k = int(input())
		a, b = list(map(int, input().split()))

	elif filename == '__random__':
		from random import randint as rng
		a = rng(1, 10**3)
		b = rng(a, 10**3)
		k = rng(1, 10**3)
		print(k)
		print(a, b)

def get_answer():
	answer = 'NG'

	target = (b // k) * k

	if target >= a:
		answer = 'OK'

	return answer

if __name__ == '__main__':
	format_input()

	ans = get_answer()
	print(ans)

Solution (Python):
def main():
  K = int(input())
  A, B = map(int, input().split())
  n_A = A // K
  n_B = B // K
  if n_B > n_A:
    print('OK')
  elif n_B == n_A and B % K ==0:
    print('OK')
  elif n_B == n_A and A % K ==0:
    print('OK')
  else:
    print('NG')

main()

Solution (Python):
import math
def I():
  return input()
def II():
  return int(input())
def MII():
  return map(int, input().split())
def LMII():
  return list(map(int, input().split()))

n = II()
a, b = MII()

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

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

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

    print(s)

main()

Solution (Python):
i = int(input())
i2 = list(map(int,input().split()))

f = 0
for x in range(i2[0],i2[1]+1):
    if x % i == 0:
        f = 1

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

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

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

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

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

print('NG')

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

Solution (Python):

K = input()
line = input().split(" ")
a = False
for i in range(int(line[0]), int(line[1]) + 1):
    if i%int(K)==0:
        print("OK")
        a = True
        break
if a == False:
    print("NG")

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

if a > k:
    temae = (a//k)*k
    if a <= temae + k <= b or a <= temae <= b:
        print('OK')
    else:
        print('NG')
else:
    if a <= k <= b:
        print('OK')
    else:
        print('NG')

Solution (Python):
K=int(input())
X=input().split(" ")
A=int(X[0])
B=int(X[1])
if B//K-A//K==0:
  if A%K==0 or B%K==0:
    print("OK")
  else:
  	print("NG")
else:
  print("OK")

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

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

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

Solution (Python):
k=int(input())
a,b=map(int,input().split())
val=a%k
if(val==0):
	print("OK")
else:
	if(k-val+a<=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"
        break

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

import sys


def solve(K: int, A: int, B: int):
    a=[i for i in range(0, 1001) if i % K == 0]
    b=list(range(A,B+1))
    for i in range(len(b)):
        if b[i] in a:
            print("OK")
            exit()
    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):
N = int(input())
A,B = map(int,input().split())

list = [i for i in range(A,B+1)]
for j in list:
    if j % N == 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")
    quit()
  else:
    print("NG")
    quit()

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

Solution (Python):
K = int(input())
com = list(map(int,input().split()))
A= com[0]
B = com[1]

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):
K = int(input())
A, B = map(int, input().split())
if B//K - (A-1)//K > 0:
    print('OK')
else:
    print('NG')

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

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

while(K <= B):
  if(K >= A):
    print("OK")
    flag = 1
    break
  else:
    K += num
if(flag == 0):
  print("NG")

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

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

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

num_list = range(A,B+1)

ans = [x for x in num_list if x%K==0]

if len(ans)>0:
    print('OK')
else:
    print('NG')

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

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

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

if true_count > 0:
    print('OK')
else:
    print('NG')

Solution (Python):
K = int(input())
A, B = [int(s) for s in input().split()]
if K * (A // K + int(A % K > 0)) <= B:
    print('OK')
else:
    print('NG')

Solution (Python):
K = int(input())
A,B = map(int, input().split())
flag = False
for i in range(B//K+1):
    if K*i>= A and K*i<=B:
        flag = True
if 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'
print(ans)

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

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

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

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

def f(a,b,k):
	for j in range(a,b+1):
		if j % k == 0:
			return True
	return False
print 'OK' if f(a,b,k) else 'NG'

Solution (Python):


def main():

    k = int(input())
    
    n = [int(x) for x in input().split(' ')]
    a = n[0]
    b = n[1]
    flag = False

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

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

if __name__ == '__main__':
    main()

Solution (Python):
goal=int(input())
list=input().split(" ")
max=int(list[1])
min=int(list[0])
flag=0
for i in range(min,max+1):
    if i%goal==0:
        flag=1;

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

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

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

Solution (Python):



from math import *
from copy import *					
from heapq import *					
from string import *				
from random import *				
from bisect import *				
from sys import stdin				
from sys import maxsize				
from operator import *				
from itertools import *				
from collections import Counter		
from collections import defaultdict 

'''

'''

def solve(l):
	n = len(l)
	

N = int(stdin.readline())
a,b = list(map(int, stdin.readline().rstrip().split()))
f = 0
for i in range(a,b+1):
	if(i%N == 0):
		f = 1
		break
if(f):
	print('OK')
else:
	print('NG')

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


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

while True:
	ki = k * i
	
	if ki >= a and ki <= b:
		print('OK')
		sys.exit()
	elif ki > 1000:
		break
	
	i += 1

print('NG')

Solution (Python):
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    K = input_number()
    A, B = input_number_list()
    a = -(-A // K)
    b = B // K
    isOK = A <= a*K <= b*K <= B
    print(['NG', 'OK'][isOK])


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 = map(int, input().split())
print("OK" if A % K == 0 or B % K == 0 or ((A//K)+1)*K <= B else "NG")

Solution (Python):


import sys
n = int(input())
[a, b] = [int(x) for x in input().split()]

for x in range(1000):
    s = x * n
    if b >= s and a <= s:
        print("OK")
        sys.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:
        print('OK')
        flag=True
        break
if not flag:
    print('NG')

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

ans='NG'

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

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

count = 1
total = 0
ans = False
while total <= 1000:
    total = K * count
    if A <= total and total <= B:
        ans = True
    count += 1
print("OK") if ans 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())
if a % k == 0 or b % k == 0:
    print('OK')
elif abs(a // k - b // k) > 0:
    print('OK')
else:
    print('NG')

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

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

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

ans=0

for i in range(a,b+1):
  if i%k==0:
    ans+=1
    break
    
if ans==0:
  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 = list(map(int, input().split()))
c = 2
k2 = k

while True:
    if k2 <= b and k2 >= a:
        print("OK")
        break
    else:
        k2 = k * c
        c += 1

    if k2 > b:
        print("NG")
        break

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

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

flag = False
for i in range(1000):
    if A <= i*K and i*K <= B:
        flag = True

if 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'
if K == 1:
  ans = 'OK'
print(ans)

Solution (Python):
from math import ceil 
import numpy as np
 
def inp(): return int(input()) 
def inpm(): return map(int,input().split()) 
def inpl(): return list(map(int, input().split())) 
def inpls(): return list(input().split()) 

K = inp()
A, B = inpl()

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

Solution (Python):
k = list(map(int, input().split()))[0]
a, b = list(map(int, input().split()))
for i in range(1, 10000):
    n = k * i
    
    if n >= a and n <= b:
        print("OK")
        break
    elif n > b:
        print("NG")
        break

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

Solution (Python):
import sys

k_goal = int(input())
a_current_min, b_current_max = map(int, input().split())

for i in range(a_current_min, b_current_max + 1):
    if i % k_goal == 0:
        print('OK')
        sys.exit(0)

print('NG')

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

frag = 'NG'
C = B - A
for i in range(C + 1):
    if (i + A) % K == 0:
        frag =  "OK"

print(frag)

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

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

count = 0
for i in range(1, 1001):
    a = i * K
    if A <= a:
        if a <= B:
            count += 1
    else:
        pass
if count >= 1:
    print("OK")
else:
    print("NG")

Solution (Python):

K = int(input())
A, B = map(int, input().split())
X = A // K
Y = B // K
if A % K != 0:
    X = X + 1
if Y >= X :
    print("OK")
else:
    print('NG')

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

ok = False
for i in range(a,b+1):
  if i%k == 0:
    print('OK')
    ok = True
    break
if not ok:
    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())
def solve():
    for i in range(a,b+1):
        if(i%k==0):
            print("OK")
            return
    print("NG")
    
solve()

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

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

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

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(' '))
p=a
t=0
while p<=b:
    if p%k==0:
        t=1
        break

    p=p+1

if t==1:
    print('OK')
else:
    print('NG')

Solution (Python):
import sys
import math

K = int(input())
A, B = map(int, sys.stdin.readline().strip().split())

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

Solution (Python):
k = int(input())
line = input().split()
a = int(line[0])
b = int(line[1])

q_a, mod_a = divmod(a, k)
q_b, mod_b = divmod(b, k)

if mod_a == 0 or mod_b == 0 or q_a != q_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")
        quit()
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
        break
if c==1:
    print('OK')
else:print('NG')

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

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

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

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

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

is_exist = False
for tmp in range(num_list[0], num_list[1]+1):
    if tmp % num == 0:
        is_exist = True
        break

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

Solution (Python):
class abc_165:
    
    def __init__(self):
        pass
    
    def A(self):
        K=int(input())
        AB=list(map(int,input().split()))
        flag=False
        
        for i in range(AB[0],AB[1]+1):
            if i%K==0:
                flag=True
                break
            else :pass
        
        if flag==True:print("OK")
        else: print("NG")
    
    def B(self):
        pass
    
    def C(self):
        pass
        
    def D(self):
        pass
    
    def E(self):
        pass
    
    def F(self):
        pass
    
    
if __name__=='__main__':
    obj=abc_165()
    obj.A()

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

n = a//k

if (a == n*k) or (b >= (n+1)*k):
  print('OK')
else: 
  print('NG')

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

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

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

print('NG')

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

i = 1
m = K
while m <= B :
	if A <= m <= B:
		print('OK')
		exit()
	i += 1
	m = K * i

print('NG')

Solution (Python):
i=int(input())
a = list(map(int, input().split()))
if int(a[0]/i)==int(a[1]/i) and a[0]%i!=0:
    print('NG')
else:
    print('OK')

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

hoge = int(a/k)
hoge *= k
hoge += k
if a%k == 0:
    print("OK")
elif a<=hoge and hoge<=b:
    print("OK")
else:
    print("NG")

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

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

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

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

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

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

if x == 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()
print("NG")

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

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

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

print('NG')

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

Solution (Python):

import sys
import itertools
import fractions
import copy
import bisect


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter





N=3
M=3
i=0
j=0
k=0
n=3
r=1
a=[0]*5
b=[]
k=int(input())





"1行1つの整数を入力を取得し、整数と取得する"



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

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

print("NG")


"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"















'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''


'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

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

Solution (Python):
n = int(input())
ab = input().split()

a = int(ab[0])
b = int(ab[1])

c = 'NG'
m = n
while True:
	if a <= m <= b:
		c = 'OK'
		break
	if b < m:
		break
	m += n

print(c)

Solution (Python):
import numpy as np
import sys

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

list1 = list(np.arange(A,B+1))

for i in list1:
    if i%K==0:
        print("OK")
        sys.exit()    
print("NG")

Solution (Python):


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

n = 0
for i in range(int(B)):
    n += int(K)
    if int(A)<=n and n<=int(B):
        print("OK")
        break
    elif int(B)<n:
        print("NG")
        break

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

if count > 0:
    print('OK')
else:
    print('NG')

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

Solution (Python):
import sys

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

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

print("NG")

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

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

Solution (Python):
K = int(input())
A, B = map(int, input().split())
result = False
if A % K == 0:
    result = True
if B % K == 0:
    result = True
if (A // K) != (B // K):
    result = True

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

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

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

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

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


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

print(answer)

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

Solution (Python):
k = int(input())
a,b = list(map(int,input().split()))
rem = a%k
if rem > 0 and (k - rem) > (b - a):
	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
  if i==b:
    print('NG')

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

if (b-1)//n > (a+1)//n or a%n==0 or b%n ==0:
    print('OK')
else:
    print('NG')

Solution (Python):
x = int(input())
min, max = map(int, input().split())

a=min//x
b=min%x

c=max//x
d=max%x

ans='OK'

if a==c and b!=0:
    ans='NG'

print(ans)

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

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

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

Solution (Python):
import sys
ｋ=int(input())
a,b=map(int,input().split())

res=k
i=1
cnt=0
while res <= b:
    if res < a:
        res+=k
    else:
        print("OK")
        sys.exit()

print("NG")

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

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

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

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

print(c)

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

solution()

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

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

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())
print("OK" if b // k > (a - 1) // k else "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")