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 = list(map(int,input().split()))
for i in range(a//k,b//k+1):
    if (k*i) <= b and k*i >= a:
        print('OK');        break
else:
    print('NG')

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

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

Solution (Python):
K = int(input())
a, b = input().split()
isOK=False

for i in range(int(a),int(b)+1,1):
  if i%K==0:
    isOK=True

if isOK:
  print('OK')
else:
  print("NG")

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

ans = 'NG'

if a % k == 0 or b % k == 0:
    ans = ('OK')

if (a // k) != (b // k) or k==1 :
    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())
ans = "NG"
for i in range(a,b+1):
    if not i%k :
        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())
n = 0
for m in range(100):
    if A<=K*m and K*m<=B:
        n += 1
if n > 0:
    print('OK')
else:
    print('NG')

Solution (Python):
K=int(input())
A,B=map(int,input().split())
E=False
C=B%K
D=(B-C)//K

for i in range(D):
    if A<=K*(i+1) and K*(i+1)<=B:
        E=True
        break
    else:
        pass
if E==False:
    print("NG")
else:
    print("OK")

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

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

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

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

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

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

Solution (Python):
k = input()
K = int(k)
t = input().split()
T =[int(s) for s in t]
a1 = T[0] // K
b1 = T[1] // K
a2 = T[0] % K
if a1 == b1 and a2 != 0:
    print('NG')
else:
    print('OK')

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

Solution (Python):
K, A, B = [int(_) for _ in open(0).read().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+1 >= k or 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())

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

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

result = False
for i in range(1, 1000):
    if A <= K * i and K * i <= B:
        result = True
        break

    if K * i > B:
        break

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

Solution (Python):
k = int(input())
a, b = [int(i) for i in input().split(' ')]
if a // k != b // k or a % k == 0 or b % k == 0:
  print('OK')
else:
  print('NG')

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

Solution (Python):
import math

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

Solution (Python):
k = int(input())
mAB = map(int, input().split())
lAB = list(mAB)

if(lAB[0] % k == 0):
    print('OK')
elif (lAB[0] // k != lAB[1] // k):
    print('OK')
else:
    print('NG')

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

x = 0


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


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

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

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

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

print('NG')

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

Solution (Python):
import sys

lines = 2
inp = list()

for _ in range(lines):
    inp.append(sys.stdin.readline().strip())


k = int(inp[0])
ab = inp[1].split()
a = int(ab[0])
b = int(ab[1])

na1, na2 = divmod(a, k)
nb1, nb2 = divmod(b, k)

if na1 < nb1 or na2 == 0 or nb2 == 0:
    print("OK")
else:
    print("NG")

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

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

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

k=min(A+K,B)
t=0
for i in range(A,k+1):
    if i%K==0:
        t=+1
        break

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

Solution (Python):
K = int(input())
A,B=map(int,input().split())
i = 2
N = 0
while N <1001:
    N +=K
    if A <= N <=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")
        break
else:
    print("NG")

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

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

m = b // a
n = m * a
if (b % a == 0):
    print("OK")
elif (n + a <= c):
    print("OK")
else:
    print("NG")

Solution (Python):
import sys
import math

lines = sys.stdin.readlines()
K = int(lines[0])
X = lines[1].split(' ')

A = int(X[0])
B = int(X[1])

n = math.ceil(A/K)-1
m = int(B/K)

if m-n >0:
    print('OK')
else:
    print('NG')

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

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

print "NG"

Solution (Python):

N = int(input())
lists = list(map(int, input().split()))
if lists[0] % N == 0 or lists[1] % N == 0:
    print("OK")
elif ((lists[0]//N) * N) + N < lists[1]:
    print("OK")
else:
    print("NG")

Solution (Python):
k = int(input())
a,b = (int(x) for x in input().split())
ki = k
f=0
while ki <= b:
  if ki >= a and ki <= b:
    print("OK")
    f=1
    break
  ki += k
if f == 0:
  print("NG")

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

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


if __name__ == '__main__':
    main()

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

    m = A % k
    
    if m==0:
        print("OK")
    else:
        if (k-m) <= (B-A):
            print("OK")
        else:
            print("NG")
        
if __name__ == "__main__":
    main()

Solution (Python):
import sys

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

if A == B and A % K == 0:
  print("OK")
  sys.exit()

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

Solution (Python):
k = int(input())
A,B = map(int,input().split())
t = (A//k)+1 if A%k != 0 else A//k
s = B//k
print('OK'if t<=s else 'NG')

Solution (Python):
a=int(input())
b=input().split()
c = int(b[0]) % a
if c ==0:
    c = a
d = int(b[1]) - int(b[0])
if c + d >= 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())
s = input()
a = int(s.split(" ")[0])
b = int(s.split(" ")[1])


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

Solution (Python):
K=int(input())
A,B=list(map(int,input().split()))
n=int(A/K)
m=int(B/K)
if K==1:
  print("OK")
elif A/K-n==0.0 or B/K-m==0.0:
  print("OK")
elif m-n>=1:
  print("OK")
else:
  print("NG")

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

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

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

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

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

flag = 0
for i in range(1000):
    if (a <= k * (i+1)) and (b >= k * (i+1)):
        print("OK")
        flag = 1
        break
if flag != 1:
    print("NG")

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

n=0
while(True):
   n=n+k
   if(n<a):
       continue
   elif(a<=n and n<=b):
       print("OK")
       exit()
   else:
       print("NG")
       exit()

Solution (Python):
K = int(input())
A, B = (int(x) for x in input().split())
length = (B-A) + 1
answer = True

for i in range(length):
    if A%K == 0:
        answer = True
        break
    else:
        answer = False
    A += 1

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

Solution (Python):
a = int(input())
b, c = map(int, input().split())
ok = 0

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

Solution (Python):
def main():
    k = int(input())
    a = list(map(int, input().split()))
    if a[0]%k == 0:
        print("OK")
    elif int(a[0]/k) == int(a[1]/k):
        print("NG")
    else:
        print("OK")
if __name__ == '__main__':
    main()

Solution (Python):
K = int(input()) 
A, B = map(int, input().split())
import math
n = math.floor(B / K) 
if n >= A / 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
        break
if count == 1:
    print('OK')
else:
    print('NG')

Solution (Python):
"""
ジャンボ高橋君はゴルフの練習をすることにしました。
ジャンボ高橋君の目標は飛距離をKの倍数にすることですが、ジャンボ高橋君の出せる飛距離の範囲はA以上B以下です。
目標の達成が可能であれば OK と、不可能であれば NG と出力してください。
"""
k = int(input())
a, b = map(int, input().split())
checkF = False
for i in range(a, b+1):
    if i % k == 0:
        checkF = True

print('OK' if checkF 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):
N = int(input())
lis = input().split()
a = int(lis[0])
b = int(lis[1])



li = []
zero = 0

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

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

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







Awari = -(-A // K)



if B >= Awari*K:
    print("OK")
else:
    print("NG")

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

c=b//k

if a<=c*k:
  print("OK")
else:
  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())
AB=input().split()
A=int(AB[0])
B=int(AB[1])
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())
n=a//k
if (k*n>=a and k*n<=b) or ((n+1)*k>=a and (n+1)*k<=b):
    print("OK")
else:
    print("NG")

Solution (Python):

def main():
    k = int(input())
    a, b = map(int, input().split())
    ans = [i for i in range(a, b+1) if i % k == 0]
    if len(ans) == 0:
        print('NG')
    else:
        print('OK')

main()

Solution (Python):
K=int(input())
A, B = map(int, input().split())
a=A//K
b=A%K
c=B%K

if(b==0 or c==0):
  print("OK")
else:
  if(1<a):
    if(a*K<=B):
      print("OK")
    else:
      print("NG")
  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
    elif i == b:
        print("NG")
        break
    else:
        continue

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;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=lambda x:int(math.floor(x)),lambda x:int(math.ceil(x))
from functools import reduce;gcd=lambda*x:reduce(math.gcd,x);lcm=lambda*x:reduce(lambda x,y:(x*y)//gcd(x,y),x,1)
from collections import deque
Yes=lambda b:print("Yes"if b else"No");YES=lambda b:print("YES"if b else"NO")
is_even=lambda x:True if x%2==0 else False

def main():
  k=aint();a,b=ints()
  ans=0
  for i in range(a,b+1):
    if i%k==0:
      ans+=1
      break
  print("OK"if ans>0 else"NG")

if __name__ == '__main__':
    main()

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

    if(i%K==0):
        print("OK")
        f =1
        break

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

Solution (Python):
def resolve():
    k=int(input())
    a,b=map(int,input().split())
    c=a%k
    d=b-a
    e=k-c
    if c==0 or d>=e:
        print('OK')
    else:
        print('NG')
        
resolve()

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

Solution (Python):
import sys
import os

def file_input():
    f = open('../Beginner_Contest_165/input.txt', 'r')
    sys.stdin = f

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

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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
inp = [input() for i in range(2)]
k = int(inp[0])
inlist = inp[1].split()
low = int(inlist[0])
high = int(inlist[1])

mod = low % k
dist = k - mod
if (mod == 0):
  print("OK")
elif (low + dist <= high) :
  print("OK")
else:
  print("NG")

Solution (Python):
def main(K, A, B):
    a = int(A / K)
    b = int(B / K)
    if A == 0 or (a == b and A % K != 0):
        print('NG')
    else:
        print('OK')


if __name__ == '__main__':
    K = int(input())
    A, B = list(map(int, input().split()))
    main(K, A, B)

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")


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



if __name__ == '__main__':
    solve()

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

Solution (Python):
K = int(input())
N = list(map(int, input().split())) 
flag = False

for i in range(N[0],N[1]+1):
  if i % K == 0:
    print('OK')
    flag = True
    break
   
if flag == False:
  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
  else:
    count += 0
    
if(count == 0):
  print("NG")
else:
  print("OK")

Solution (Python):

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

print("OK" if A % K == 0 or B % K == 0 or A // K != B // K or K == 1 else "NG")

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

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

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):
K = int(input())
A, B = map(int, input().split())

if A // K != B // K or (A // K == B // K and 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):
s = [input() for i in range(2)]

K = int(s[0])
A = int(s[1].split()[0])
B = int(s[1].split()[1])

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

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

n = sum(i%K == 0 for i in L)

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

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

check =0
c=a
for i in range(1001):
    if a>=b[0] and a<=b[1]:
        check = 1
        print('OK')
        break
    a=a+c
if check==0:
    print('NG')

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

def check(K,A,B):
    if B//K-(A-1)//K>0:
        return 'OK'
    return 'NG'
print(check(K,A,B))

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

Solution (Python):
import math
k = input()
a, b = input().split()
k = int(k)
a = int(a)
b = int(b)
a_k = math.ceil(a / k)
b_k = int(b / k)
if (b_k - 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):
K = int(input())
A, B = map(int, input().split())

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

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





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


print("NG")

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

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

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

f = False
for i in range(1, 1001):
  t = i * k
  if a <= t and t <= b:
    f = True
    break
  if t > b:
    break

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

Solution (Python):
target_multi = int(input())
(min, max) = tuple(map(int, input().split(' ')))


is_ok = False
for i in range(min, max + 1):
  if(i % target_multi == 0):
    print("OK")
    is_ok = True
    break

if not(is_ok):
  print("NG")

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

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

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

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

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

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

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

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

iA=A//K
iB=B//K

Ks = [i*K for i in range(iA,iB+1)]

if iB == 0:
    print('NG')
else:
    for k in Ks:
        if A <= k <= B:
            print('OK')
            exit()
    print('NG')

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

Solution (Python):

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

if B-A == 0:
    if A%K==0:
        print("OK")
        exit()
    else:
        print("NG")
        exit()
else:
    pass

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

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

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

Solution (Python):

K = int(input())
A,B=[int(i) for i in input().split(" ")]
if A%K == 0:
    print("OK")
elif (A//K+1)*K <= B:
    print("OK")
else:
    print("NG")

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

Solution (Python):
K = int(input())
A, B = map(int, input().split())
N = B - A
if B%K-N<=0:
  print("OK")
else:
  print("NG")

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

c=a//K*K
d=c+K

if a<=c<=b:
    print('OK')
elif a<=d<=b:
    print('OK')
else:
    print('NG')

Solution (Python):
K = int(input())
S, W = map(int, input().split())
ans = 0
for i in range(S,W+1):
    if i%K == 0:
        ans += 1
if ans > 0:
    print('OK')
else:
    print('NG')

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

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

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

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

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

print(sample(a,b,k))

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 findNum(a, b, k):
    for i in range(a, b+1):
        if i % k == 0:
            return True
    return False
K = int(input())
A, B = list(map(int, input().split()))

print('OK' if findNum(A, B, K) else 'NG')

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

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

print('OK' if is_ok(K, A, B) else 'NG')

Solution (Python):
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")
		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
  if i == b:
    print('NG')

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

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

for i in range(1, 1000):
  if k * i <= 1000:
    if k * i >= a and k * i <= b:
      print("OK")
      break
  else:
    print("NG")
    break

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

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

Solution (Python):
n=int(input())
a,b=map(int,input().split())
i=a
while i<=b:
  if i%n==0:
    print("OK")
    break
  i+=1
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 math
import sys

k=int(input())

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

ans = math.floor(a/k)*k
if ans == a:
    print("OK")
    sys.exit()

ans += k

if ans <= b:
    print("OK")
else:
    print("NG")

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

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

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

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

Solution (Python):
X = int(input())
Y, Z = map(int, input().split())
a = Y%X
if a != 0 and Z >= Y-a+X:
    print('OK')
elif a == 0:
    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:
    x = (a // k) * k + k
    if b >= x:
        print('OK')
    else:
        print('NG')

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

ans = k
flag = True
while True:
    if (ans < a):
        ans += k
        continue
    if (ans <= b):
        break
    else:
        flag = False
        break

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

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

Solution (Python):
c = int(input())
k=0
a,b=map(int,input().split())
for ac in range(1,1000):
  if a <= (c*ac) <= b:
    k+=1
if k>=1:
  print('OK')
else:
  print('NG')

Solution (Python):
k = int(input())
a,b = list(map(int, input().split()))
s = [i for i in range(a,b+1)]
cnt = 0
for j in range(0,len(s)):
    if s[j]%k == 0:
        cnt +=1
    else:
        cnt+=0
if cnt==0:
    print('NG')
else:
    print('OK')

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

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

s="NG"
for i in range(10000):
    if k*i>=a and k*i<=b:
        s="OK"
        break

print(s)

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

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

a=A%K

b=K-a

c=A+b

if a!=0:
    if c > B:
        print('NG')
    else:
        print('OK')
else:
    print('OK')

Solution (Python):
k = int(input())
ab = input().split(" ")
a = int(ab[0])
b = int(ab[1])
n = a
m = 0
while n <= b:
  if n % k == 0:
    print("OK")
    m = 1
    break
  n += 1
if m == 0:
  print("NG")

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

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

if a == b:
  if (A % K) * (B % K) == 0:
    print('OK')
  else:
    print('NG')
else:
  print('OK')

Solution (Python):




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

for i in range(a,b+1):
    ans = i%k

    if ans==0:
        print("OK")
        exit()

print("NG")

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

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

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

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

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

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