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 = list(map(int, input().split()))
flg = "NG"
for i in range(a, b + 1):
    if i % a == 0:
        flg = "OK"
        break

print(flg)

Submission status: Wrong Answer

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

Aa = A // K
Bb = B // K
if K == 1:
    print('OK')
elif A == B and K % A == 0:
    print('OK')
elif Aa == Bb:
    print('NG')
else:
    print('OK')

Submission status: Wrong Answer

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

max = int(b/k)

for i in range(1,max+1):
    tmp = k * i
    if a <= tmp and b >= tmp:
        print('Yes')
        exit()

print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
def main():
    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
    if OK == False:
        print("NG")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a=A/K
b=B/K
if 1<=a-b or a-b<=-1 or a-b==0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

k
x=a/k
y=b/k

if y-x>=1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

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

if b - a >0:
    print ("OK")
else:
    print ("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def iin(): return int(input())
def iln(): return list(map(int, input().split()))

K = iin()
A, B = iln()

curr_num = 1
while curr_num < A:
    curr_num += K

if A <= curr_num <= 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:
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')
        break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = int(input())
S, W = map(int, input().split())
ans = 0
for i in range(S,W):
    if i%K == 0:
        ans += 1
if ans > 0:
    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:
k = int(input())
a, b = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int,input().split())
n_A = A//K
n_B = B//K
if n_B - n_A >= 1:
  print("Yes")
else:
  print("No")
print(n_A, n_B)

Submission status: Wrong Answer

Solution code:
k=int(input())
lit=str(input()).split(" ")
a=int(lit[0])
b=int(lit[1])

if k == 1:
    print("OK")
    exit()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
result=0
for i in range(1000):
  tmp=K*i
  if A<=K<=B:
    result=1
    break
  if K>B:
    break
if result==1:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

c = B//K
if B % K == 0 or 500 <= K*(c-1):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 'NG'
check = K
while check < 1000:
    check += K
    if A <= check and check <= B:
        ans = 'OK'
        break

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
n= int(input())

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

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

print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a ,b = list( map( int ,input().split()))
if n == 1 :
  print('OK')
  exit(0)
if ( b//n - a //n >=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:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
import random
import math
LI = lambda: list(map(int,input().split()))
MI = lambda: map(int,input().split())
yes = lambda: print("Yes")
no = lambda: print("No")
I = lambda: list(input())
J = lambda x: "".join(x)
II = lambda: int(input())
SI = lambda: input()
#---khan17---template
t = II()
a,b = MI()
boo = False
for i in range(a,b+1):
	if a%t == 0:
		boo = True
		break
print("OK" if boo else "NG")

Submission status: Wrong Answer

Solution code:
from math import floor
k = int(input())
a,b = map(int,input().split())
if (floor(a/k) <= floor(b/k)):
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
i = 1
while i*k < b:
    if a < i*k < b:
        print("OK")
        break
    i += 1
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
#a
M = int(input())
N,K=map(int,input().split())
if K-N+1>=M:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

ans = "NG" if b/k - a/k < 1 and b%k != 0 and a%k != 0 else "OK"
print(ans)

Submission status: Wrong Answer

Solution code:
ｋ=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+1)*k < b:
    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()

print('NO')

Submission status: Wrong Answer

Solution code:
def solve(a,b,k):
    for x in range(a,b+1):
        if a%k==0:
            return "OK"
    return "NG"

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while k >= a:
    k += n

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

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

Submission status: Wrong Answer

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

if B - A + 1>= K :
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
a,b = map(int,input().split())
if b-a+1>=k:
  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:
    c = b % k
    d = a % k
    if d >= c: print("OK")
    else: print("NG")

Submission status: Wrong Answer

Solution code:
goal=int(input())
list=input().split(" ")
max=int(list[0])
min=int(list[1])
if(max-min>=goal):
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = 'NO'

if a % k == 0 and b % k == 0:
  ans = 'OK'
if a // k != b // k:
  ans = 'OK'

print(ans)

Submission status: Wrong Answer

Solution code:
import sys

def main():
    input = sys.stdin.readline
    K = int(input())
    A, B = map(int, input().split())
    if B - A >= K:
        return 'OK'
    else:
        return 'NG'

if __name__ == '__main__':
    print(main())

Submission status: Wrong Answer

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

i = 0;
while K*i<=B:
    if K*i>=A:
        print("YES")
        exit()
    i=i+1
        
print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

k = ii()
a,b = iim()
flag = False
for i in range(a,b+1):
    if i%k == 0:
        flag = True
        break
print('OK' if flag else 'NO')

Submission status: Wrong Answer

Solution code:
import os
import sys
from collections import deque
from collections import Counter
from heapq import heappop,heappush

def main():
	k = int(input())
	a,b = map(int, input().split())
	if a == b:	
		print("Yes")
		sys.exit()
	if b - a >= k:
		print("Yes")
	else:
		print("NO")

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

if A%K==0 or B%K ==0:
    print('Yes')
elif ((A//K)*K+K)<=B:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A = int(input())
B,C = map(int,input().split())
f = "No"
for i in range(B,C+1):
    if i % A == 0:
        f = "Yes"
print(f)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a,b = map(int,input().split())
m = a%n
if m + a <= b:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def judge():
  for x in range(A,B+1):
     if x%K==0:
        return 'Yes'
  return 'No'
  
print(judge())

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

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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
if (b-a+1)<k:
   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):
    if i % k == 0:
        print("OK")
        exit(0)
print("NG")

Submission status: Wrong Answer

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

ans = 'NG'
if a%k == 0 or b//k ==0:
    ans = 'OK'
if a//k < b//k:
    ans = 'OK'

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print('OK' if B - A + 1 >= K else 'NG')

Submission status: Wrong Answer

Solution code:
def main():
  K=int(input())
  A,B=map(int,input().split())
  if A%K==0 or B%K==0 or int(B%K)>int(A%K):
    print("OK")
  else:
    print("NG")
if __name__=='__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

if(a//x == b//x):
  if(a/x != b/x):
    print('NG')
  else:
    print('OK')
else:
  print('OK')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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")
else:
  if (B-A+1)>=K:
    print("NG")
  else:
    print("OK")

Submission status: Wrong Answer

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

k = int(input())
n, m = map(int, input().split())

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

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


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

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=[int(_) for _ in input().split()]
if ((a//k)+1)*(k)<=b or a==b:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

#print(k,a,b)

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

if flug==0:
    print("no")

Submission status: Wrong Answer

Solution code:
n = int(input())
a,b = map(int, input().split())
if (b-a)//n>=1:
    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")
        break
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

j = a % k + (b - a)
if j >= k:
    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 a//k != b//k:
    print("OK")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import bisect,sys
import math
from collections import deque

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max, mod=DIV):
    fac, finv, inv = [0]*max, [0]*max, [0]*max
    fac[0] = fac[1] = 1
    finv[0] = finv[1] = 1
    inv[1] = 1
    for i in range(2, max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod - inv[mod % i] * (mod//i) % mod
        finv[i] = finv[i-1]*inv[i] % mod

    class CONV:
        def __init__(self):
            self.fac =fac
            self.finv = finv
            pass

        def ncr(self, n, k):
            if(n < k):
                return 0
            if(n < 0 or k < 0):
                return 0
            return fac[n]*(finv[k]*finv[n-k] % DIV) % DIV
        
    return CONV()



sys.setrecursionlimit(200005)


def main():
    K = iRaw()
    A,B = isRaw()
    div = A//K
    if A%K !=0:
        div+=1
    ans = "OK" if (div*K)<=B  else "NO"
    return ans

if __name__ == "__main__":
    print(main())

Submission status: Wrong Answer

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

    if b - a < k-1:
        print("NG")
        exit()

    print("OK")


if __name__ == '__main__':
    main()

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 (B//K - A//K)>=1 or B%K == 0 or A%K == 0:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if B-A+1<K:
  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("NG")
        break
else:
    print("OK")

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

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

if c-b+1>=a:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
def main(K, A, B):
    a = A / K
    b = B / K
    if A % K == 0:
        print('OK')
    elif a == b:
        print('NG')
    else:
        print('OK')


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

Submission status: Wrong Answer

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

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:
a=int(input())
x,y = map(int,input().split())	

b = x//a
c = y//a

if c-b >= 1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
import sys
#sys.exit()
#sorted( ,reverse=True)
K = int(input())
A,B = map(int, input().split())
if B/K - A/K >=1:
    
#A = list(map(int, input().split()))

    print('OK')
elif A/K >= 1:
    print('OK')
    
else:
    
    print('NG')
#print(A)
#print('Yes')
#print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
"""
    This template is made by Satwik_Tiwari.
    python programmers can use this template :)) .
"""

#===============================================================================================
#importing some useful libraries.

import sys
import bisect
import heapq
from math import *
from collections import Counter as counter  # Counter(list)  return a dict with {key: count}
from itertools import combinations as comb # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
from itertools import permutations as permutate
from bisect import bisect_left as bl #
from bisect import bisect_right as br
from bisect import bisect

#===============================================================================================
#some shortcuts

mod = pow(10, 9) + 7
def inp(): return sys.stdin.readline().strip() #for fast input
def out(var): sys.stdout.write(str(var))  #for fast output, always take string
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
def graph(vertex): return [[] for i in range(0,vertex+1)]
def zerolist(n): return [0]*n
def nextline(): out("\n")  #as stdout.write always print sring.
def testcase(t):
    for p in range(t):
        solve()
def printlist(a) :
    for p in range(0,len(a)):
        out(str(a[p]) + ' ')
def lcm(a,b): return (a*b)//gcd(a,b)


#===============================================================================================
# code here ;))

def solve():
    k = int(inp())
    a,b = sep()
    if (b//k) - (a//k) > 0:
        print('OK')
    else:
        if(k == 1):
            print('OK')
        else:
            print('NG')



testcase(1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B= list(map(int, input().split()))
S = 0
while S<=A:
    S += K
if S<=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 or a%k==0:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
#dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])}
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]
mp = lambda :map(int,input().split())

k = inp()
a,b = mp()
if a%k == 0 or b%k == 0 or k//b - k//a > 0:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


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


def readstrs():
    return input().split()


K = readint()
A, B = readnums()

if B - A < K 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 B - A >= K:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
import sys
K=int(input())
A,B=map(int,input().split())
num=1
while K*num>B:
  if A<=K*num and K*num<=B:
    print('OK')
    sys.exit()
  num+=1
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):
  if ((i+1)%k == 0):
    ans = 'OK'
    
if (k == 1):
  ans = 'OK'
    
print(ans)

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

k = int(input())
a, b = map(int, input().replace("\n","").split())

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

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())
ans = 'NG'
if A % K == 0:
    ans = 'OK'
elif B % K == 0:
    ans = 'OK'
x = A // K
y = A // K
if y > x:
    ans = 'OK'
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline


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

c = b//k - a//k

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

Submission status: Wrong Answer

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

if a == b:
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

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

if A//N == B//N and A!=B:
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

Solution code:
k = int(input())
a, b = map(int, input().split())
bl = False
for i in range(a, b+1):
    if i % k == 0:
        bl = True
        break
if bl:
    print("ok")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor
k = int(input())
a,b = map(int,input().split())
if (floor(a/k) < floor(b/k)):
  print("OK")
else:
  print("NG")