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



Sample input:
7
500 600


Sample output:
OK

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int,input().split())
if k <= b-a+1:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

while b>=a:

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

    b-=1

if b<a:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
if K==1:
    print("OK")
elif B-A>=K:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = list(map(int, input().split()))
s = list(range(((a - 1) // k + 1) * k, b, k))
if len(s) == 0:
  print('NG')
else:
  print('YES')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
if a <= k <= b:
  print("OK")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
large = (B // K) * K
if A <= large:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
large = (B / K) * K
if A <= large:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
if A % K == 0 or B % K == 0 or B - A >= K:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

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

if k - (a % k) <= b - a:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
 
for i in range(10000):
 if a<=k*i<=b:
  print("OK")
 else:
  pass
print("NG")

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
 
for i in range(1000):
 if a<=k*i<=b:
  print("OK")
 else:
  pass
print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = list(map(int, input().split()))
s = [i for i in range(a, b) if i % k == 0]
if len(s) == 0:
  print('NG')
else:
  print('YES')

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = list(map(int, input().split()))
s = [i for i in range(a, b) if i % k == 0]
if s == []:
  print('NG')
else:
  print('YES')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
print('OK' if K==1 or A//K-B//K!=0 else 'NG')

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
x = 0
  
while True:
  x += k
  
  if a <= x <= b:
    print('OK')
    break
  
  if x > b:
    print('NO')
    break

Submission status: Wrong Answer

Solution code:
import sys

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin, setrecursionlimit
#input = stdin.buffer.readline
setrecursionlimit(10 ** 7)

from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi, radians, sin, cos

MOD = 10 ** 9 + 7
INF = 10 ** 18

#N = int(input())
#S = input()
#N, M = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]
#ABC = [list(map(int, input().split())) for _ in range(N)]

Submission status: Wrong Answer

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

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

if ct != 0:
  print('OK')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
m = k
while True:
  if a < k < b:
    print("OK")
    break
  m += k
  if m <= 1000:
    print("NG")
    break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

f = 0
for i in range(b-a+1):
    if ((i+1)%K ==0):
        f = 1

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
if a%k != b%k:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
a = int(input())

low, hi = map(int, input().split())

start = a * int(low//a)

boolean = False

while not (start > hi):
  print(start)
  if low <= start <= hi: 
    boolean = True
    break
  start += a

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

Submission status: Wrong Answer

Solution code:
a = int(input())

low, hi = map(int, input().split())

start = a * low//a

boolean = False

while not (start > hi):
  if low <= start <= hi: 
    boolean = True
    break
  start *= a

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

Submission status: Wrong Answer

Solution code:
a = int(input())

low, hi = map(int, input().split())

start = a * low//a

boolean = False

while not (start > hi):
  if low <= start <= hi: 
    boolean = True
    break

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
s = A % K
if s + A >= B:
  print('NG')
else:
  print('OK')

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
s = A % K
if s + A > B:
  print('NG')
else:
  print('OK')

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
s = A // B
if s + A > B:
  print('NG')
else:
  print('OK')

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
s = A % B
if s + A > B:
  print('NG')
else:
  print('OK')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

min_num = A//K
max_num = B//K

for i in range(min_num, max_num+1):
  if A <= i*K <= B:
    print("OK")
    exit(0)

print("NO")

Submission status: Wrong Answer

Solution code:
import copy

def main():
    K = int(input())
    A, B = map(int, input().split(' '))
    origin = copy.copy(K) 
    
    while K < 1001:
        if K >= A and K <= B:
            print('OK')
            return
        K = K + origin
    print('No')
main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python


def main():

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

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

    return print('NG')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# 165 A

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

if diff >= k or diff == 0:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if K>B:
    ans='NG'
elif A<=K and K<=B:
    ans='OK'
elif B-A+1>=K:
    ans='OK'
else:
    ans='NG'

print(ans)

Submission status: Wrong Answer

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

if B-A+1>=K:
    ans='OK'
else:
    ans='NG'

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int, input().split())
c = 0
for i in range(a,b):
  if(i%k==0):
    c+=1
if(c>=1):
  print("OK")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int, input().split())
c = 0
for i in range(a,b+1):
  if(i%k==0):
    c+=1
if(c>=1):
  print("OK")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
a,b = map(int, input().split())
if a <= K and K <= b:
    print("OK")
elif b // K > a // K:
    print("OK")
elif a - b == 0 and K == 1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
a,b = map(int, input().split())
if a <= K and K <= b:
    print("OK")
elif b // K > a // K and K!= 0:
    print("OK")
elif a - b == 0:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
a,b = map(int, input().split())
if a < K and K < b:
    print("OK")
elif (b - a) > K:
    print("OK")
elif (b-a)== 0 and K == 1:
    print("OK")
else :
    print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
ab = [int(x) for x in input().split()]

m = ab[1] / k * k
if ab[0] <= m:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
for i in range(a,b+1):
  if i % k == 0:
    print('Yes')
    exit()
print('No')

Submission status: Wrong Answer

Solution code:
a=int(input())

b=input()
b=b.split()

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

c=1

b_list=list(range(A,B,1))

for x in b_list:
  if x%a==0:
    c=c+1
if a==1:
  print("OK")
elif c==1:
  print("NG")
else:
  print("OK")

Submission status: Wrong Answer

Solution code:
a=input()

a=a.split()

b=input()

b=b.split()

K=int(a[0])
A=int(b[0])
B=int(b[1])

c=1

b_list=list(range(A,B,1))

for x in b_list:
  if x%K==0:
    c=c+1
if c==1:
  print("NG")
else:
  print("OK")

Submission status: Wrong Answer

Solution code:
a=input()

a=a.split()

b=input()

b=b.split()

K=int(a[0])
A=int(b[0])
B=int(b[1])

c=1

b_list=list(range(A,B,1))

for x in b_list:
  if x%K==0:
    c=c+1
if c==1:
  print("NO")
else:
  print("OK")

Submission status: Wrong Answer

Solution code:
a = int(input())
b, c = list(map(int, input().split()))
d = b//a
e = c//a
if d == e:
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

Solution code:
a = int(input())
b, c = list(map(int, input().split()))
d = b//a
e = c//a
if not d == e:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a = int(input())
b, c = list(map(int, input().split()))
d = b//a
e = c//a
if not d == e:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
x = int(input())
y = 100
ans = 0
while y < x:
  y = y*1.01
  ans += 1
print(ans)

Submission status: Wrong Answer

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

l = K
ans = 'NG'
for l in range(K, 1001, K):
    print(l)
    if l >= A and l <= B:
        ans = 'OK'
        break
    elif l > B:
        break

print(ans)

Submission status: Wrong Answer

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

l = K
ans = 'NG'
for l in range(K, 1000, K):
    if l >= A and l <= B:
        ans = 'OK'
        break
    elif l > B:
        break

print(ans)

Submission status: Wrong Answer

Solution code:
def main():
  k=int(input())
  a,b = map(int,input().split())
  for i in range(1000):
    if(a<=i*k and i*k <= b):
      print("Yes")
      return 0
  print("No") 
  return 0

main()

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
min_num = a // k
max_num = b // k
dif = max_num - min_num
if dif > 1:
    print('OK')
elif dif == 1 and (min_num % k == 0):
    print('NG')
elif dif == 1 and (min_num % k != 0):
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
min_num = a // k
max_num = b // k
if max_num - min_num >= 1:
    print('OK')
if max_num - min_num < 1:
    print('NG')

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
min_num = a // k
max_num = b // k
if max_num - min_num >= 1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
    print(0)
keta=1
for i in A:
    keta*=i
    if keta>1000000000000000000:
        print(-1)
    else:
        print(keta)

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
if K!=1:
    if A+K<=B:
        print("OK")
    else:
        print("NG")
else:
    print("OK")

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
largest = (B / K) * K  # B 以下の最大のKの倍数
if A <= largest:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
integral_part = A // K
if K == 1 or K % A == 0 or A <= K * (integral_part + 1) <= B:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
integral_part = A // K
if K == 1 or A <= K * (integral_part + 1) <= B:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
import numpy as np

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

driver_list = range(a, b, 1)
driver_arr = np.array(driver_list)
solver = driver_arr % k
if 0 in solver:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
if k <= b - a:
  print('OK')
else:
  if b // k <= a // k:
    print('OK')
  else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
if(abs(a-b) + 1 >= k):
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
X = int(input())
 
now = 100
cnt = 0
while now < X:
  cnt += 1
  now = int(now*1.01)
print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for num in range(int(A),int(B)):
  if num % K == 0:
    print("OK")
    exit()

print("NG")

Submission status: Wrong Answer

Solution code:
import math
def fact(n):
    ans = 1
    for i in range(2, n+1):
        ans*= i
    return ans
def comb(n, c):
    return fact(n)//(fact(n-c)*c)

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

Submission status: Wrong Answer

Solution code:
import math
def fact(n):
    ans = 1
    for i in range(2, n+1):
        ans*= i
    return ans
def comb(n, c):
    return fact(n)//(fact(n-c)*c)

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

Submission status: Wrong Answer

Solution code:
import math
def fact(n):
    ans = 1
    for i in range(2, n+1):
        ans*= i
    return ans
def comb(n, c):
    return fact(n)//(fact(n-c)*c)

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
between = b - a + 1
 
if between >= k:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
between = a - b + 1

if between >= k:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
line = input().split()

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

Submission status: Wrong Answer

Solution code:
k = int(input())
line = input().split()

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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


print('NG' if B % K == 0 | (B//K == A//K) else 'OK')

Submission status: Wrong Answer

Solution code:
K = int(input())

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


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

Submission status: Wrong Answer

Solution code:
K = int(input())

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

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int,input().split())
flag = 0

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
ans='NG'
for i in range(A,B):
    if i%K==0:
        ans='YES'
        break
print(ans)

Submission status: Wrong Answer

Solution code:

K= int(input())
list= input().split(" ")
A=int(list[0])
B=int(list[1])

print(K)
print(A)
print(B)

while(1):

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=input().split(" ")
C=int(B)//K-int(A)//K
if C==0:
  print('NG')
else:
  print("OK")

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int,input().split())
if A <= K and K <= B:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
if K==1 or B-A >=K :
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

input_list = list(range(A, B + 1))

flag = False

for i in input_list:
    if i % K == 0:
        flag = True
        break

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

Submission status: Wrong Answer

Solution code:
x = int(input())
i = 100
c = 0

while i < x:
    i = i + (i * 0.01)
    c += 1

print(c)

Submission status: Wrong Answer

Solution code:
Z=int(input())
A,B=map(int,input().split())
if Z==1:
  print('OK')
elif B-A-Z>=0:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
Z=int(input())
A,B=map(int,input().split())
if Z==1:
  print('OK')
elif B-A-Z>=2:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
N = int(input())
A,B = map(int,input().split())
ans = "NG"
for i in range(A,B):
  if i % N == 0:
    ans = "OK"
    break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1362",problemID = "B",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time,random
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    k = inp()
    a,b = invr()
    if a <= math.ceil(a / k) * (k + 1) <= b:
        print("OK")
    else:
        print("NG")
                
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def log_two(n): 
    return(math.log(n) / math.log(2))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()