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

Submission status: Wrong Answer

Solution code:
X = input()
a, b = input().split()

c = int(a) / int(X)
d = int(b) / int(X)

if X=="1" or int(c) != int(d) or int(a)==int(X) or int(b)==int(X):
  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 A%K==0 or B%K==0 or (a+1)*K<=B:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
A = list(map(int, input().split()))
d=A[1]-A[0]
ok=0
for i in range(d):
    if A[0]%K==0:
        print("OK")
        ok+=1
        break
    else:
        a=A[0]
        A[0]=a+1

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

Submission status: Wrong Answer

Solution code:
import math
K = int(input())
A, B = [int(x) for x in input().split()]
if math.ceil(A/K) <= B:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

if A%K !=0:
    c = B/K + 1
else:
    c = B/K
    
if B%K != 0:
    d = B/K - 1
else:
    d = B/K
 
if c <= d:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
i = A // K
nK = K
OK = False
if A-B > K:
  print('OK')
else:
  while nK < B:
    if (nK >= A) and (nK <= B):
      OK = True
      print('OK')
      break
    nK = i * K
    i = i + 1
if OK == False:
  print('NG')

Submission status: Wrong Answer

Solution code:
#入力
K=int(input())
A,B=map(lambda x:int(x),input().split())

flag=False
i=0
num=0
while i<=B:
	num=K*i
	if (num>=A) and (num<=B):
		flag=True
		break
	else:
		i=i+1
      
if flag:
	print("OK")
else:
	print("NO")

Submission status: Wrong Answer

Solution code:
K=()
A=()
B=()

K=int(input(""))
A, B = map(int, input().split())
V=False
C=K
D=B+2

for i in range(0,D):
      K=C*i
      print(K)
      if K>=A and K<=B:
            V=True
            break
      else:
            V=False

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

Submission status: Wrong Answer

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

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%7 == 0:
        ans = "OK"

print(ans)

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    k = I()
    a, b = LI()
    flag = False
    if k == 1:
        print(
            'OK'
        )
        exit()
    for i in range(a, b):
        if i % k == 0:
            flag = True
    if flag == True:
        print('OK')
    else:
        print('NG')
    return


# Solve
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=input()
a,b=map(int,input().split())
result=0
while int(k)<b:
    if a<=int(k) and int(k)<=b:
        result=result+1

    k=k+k
if result>0:
    print('OK')
else :
    print('NG')

Submission status: Wrong Answer

Solution code:
a=int(input())
x,y = map(int,input().split())
count = 0

for i in range(x, y + 1):
    print(i)
    if i % a == 0:
        count += 1

if count >= 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(1,b):
    if (k*i)<=b and (k*i)>=a:
        print("OK")
        break
    if i==b:
        print("NG")

Submission status: Wrong Answer

Solution code:
N = input()
A=input().split()

s=int(A[0])//int(N)
if int(A[0])%int(N)==0:
    print('OK')
else:
    if (s+1)*N>A[1]:
        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('NG')
else:
  print('OK')

Submission status: Wrong Answer

Solution code:
N = int(input())
 
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]

if Line[1] == Line[0] and Line[0]%N == 0:
    print("OK")
    
elif Line[1]-Line[0] > N:
    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 or 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-a>=k:
    print("OK")
elif 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())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# A =< K =< Bの場合
if K >= A and K <= B:
    print('OK')
elif K < (B - A):
    print('OK')
elif (K * 2) >= A and (K * 2) <= B:
    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())

ans = B // K 
ans1 = ans * K

if (ans1 >= B):
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=(int(x) for x in input().split())
if K-(A%K)<=B-A or K%A==0:print('OK')
else:print('NG')

Submission status: Wrong Answer

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

vala = A//N
valb = B//N
if vala != valb:
    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())
c = a // k * k
if a <= c <= b or a <= (c+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+1 >= 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=(int(x) for x in input().split())

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int,input().split())
temp = int(A/K)
if (temp+1)*K <= B or 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(b):
    if a <= k * i <= b:
        print('OK')
        exit()
print('NG')

Submission status: Wrong Answer

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

kk = a // k
kk = k*kk

while(kk <= 1000):
    kk = kk + k
    if(kk <= b and kk >= a):
        print("OK")
        exit()
    #print(kk)

    #j = j + 1

print("NG")

Submission status: Wrong Answer

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

C=A/K
D=B/K
if K==1:
    print('OK')
elif D-C>=1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split())
i = A // K
nK = K
OK = False
if A-B >= K:
  print('OK')
else:
  while nK < B:
    if (nK >= A) and (nK <= B):
      OK = True
      print('OK')
      break
    nK = i * K
    i = i + 1
if OK == False:
  print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
K=int(input())
A,B=map(int, input().split())
if A%K==0 or B%K==0:
  print('OK')
  exit()

c=math.ceil(A/K)
d=math.ceil(B/K)
for i in range(1,d):
  if K*(c+i) >= A and K*(c+i) <= B:
    print('OK')
    #print(K*(c+i))
    exit()
print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if k == 1:
    print('OK')
if k > b:
    print('NG')

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

print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

x = A / K
x = math.floor(x * K)
if A <= x and x <= B:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=map(int,input().split())
x=A
while x<=B:
  if x%K==0:
    y=100
    break
  else:
    x+=1
    y=0
if y==100:
  print('OK')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = (B//K) - (A//K)

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

else:
    print("OK")

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 = [int(x) for x in input().split()]

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

Submission status: Wrong Answer

Solution code:
K = input()
A,B = input().split()
if A == B:
    ans = int(A)
    if ans % int(K) == 0:
        print('OK')
        exit()
    print('NG')

for i in range(int(A), int(B)):
    if i % int(K) == 0:
        print('OK')
        exit()
    
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%7 == 0:
        ans = "OK"

print(ans)

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

tmp = 0
num = 0
while (tmp < b):
    num += 1
    tmp = k*num

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

Submission status: Wrong Answer

Solution code:
import math

k = int(input())
a, b = (int(x) for x in input().split())
outa = math.floor(a / k)
outb = math.floor(b / k)
if outa == outb and a != b and outa != a / k:
    print("NG")
else:
    print("OK")

Submission status: Wrong Answer

Solution code:
i=int(input())
n,m=map(int,input().split())
if i<=m-n:
  print('OK')
elif n==m:
  if n%i==0:
    print('OK')
  else:
    print('NG')
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")
        break
    else:
        print("NG")

Submission status: Wrong Answer

Solution code:
A = int(input())
X,Y = map(int,input().split())

if Y-X >= A:
  print("OK")
elif Y%A == 0 or X%A == 0:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

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

ans = 'NG'

if b - a + 1 >= k:
    ans = 'OK'

print(ans)

Submission status: Wrong Answer

Solution code:
k = int(input())
arr = input().split(" ")
m, n = int(arr[0]), int(arr[1])
if n//k>=2:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A,B = map(int, input().split())
if A==B and A%K==0:
    print("OK")
    exit()
if int(A/K)<int(B/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())
m = a%k
h = m + b-a +1
if(h>=k):
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

ka = a/K
kb = b/K
kaama = a%K
kbama = b%K



if kaama == 0 or kbama == 0:
  print("OK")
  
elif (kb-ka)>0:
  print("OK")
  
elif (kb-ka)==0:
  print("NG")

Submission status: Wrong Answer

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

kk = a // k

while(kk <= 1000):
    kk = kk + k
    if(kk <= b and kk >= a):
        print("OK")
        exit()
    #print(kk)

    #j = j + 1

print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
x,y = map(int,input().split())
count = 0

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

if count >= 1:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
from sys import stdin

K = int(stdin.readline().rstrip())
A, B = [int(x) for x in stdin.readline().rstrip().split()]

if (K>B):
    print("NG")
if (K%A==0):
    print("OK")
elif(B-(K%B)>=A) :
    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")
    exit()
else:
    a=A//K
    if A*(a+1)<=B:
        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 k >1000:
    ans = "NG"
else:
    for i in range(a, b):
        if (a + i) % k == 0:
            ans = "OK"
            break

print(ans)

Submission status: Wrong Answer

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

a_div_k = a // k
b_div_k = b // k

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

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
N2 = [int(_) for _ in input().split()]

ret = "NG"
a = [i for i in range(0, N2[0], N)]
b = [i for i in range(0, N2[1], N)]
if list(set(b) - set(a)):
    ret = "OK"
print(ret)

Submission status: Wrong Answer

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

for i in range(1000):
    num = i * n
    if  num < 1000:
        if a <= num  and  num <= b:
            print('OK')
            break
            
    else: print('NG')

Submission status: Wrong Answer

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

sa = B - A 
flag = 0

for i in range(sa):
	if (A+i)%K==0:
		flag = 1
		break

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

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())
	list_a = []
	if b == a:
		print("OK")
		sys.exit()

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

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

fly=0
l=[]
while fly<b:
    fly += k
    l.append(fly)

if l[-1]>=a and l[-1]<=b:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
k = int(input())
[a, b] = [int(i) for i in input().split()]
sum = k
while sum <= b:
    sum += k
    if sum >= a and sum <= b:
        print("OK")
        break
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+1,b+1):
  if (i % k)==0:
    print("OK")
    sys.exit()
print("NG")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys

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

if B < K:
    print('NG')
    sys.exit()

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

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

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

N = int(input())
A,B = map(int,input().split())
for i in range(A,B+1):
    if i%N == 0:
        print('Ok')
        exit()
print('No')

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


if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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


if len(set(range(0,1000,k)) & set(range(a-1,b))) >= 1:
    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')
elif (B-A) + (A%K) >=K:
    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")
    else:
        print("NG")

Submission status: Wrong Answer

Solution code:
X = input()
a, b = input().split()

c = int(a) / int(X)
d = int(b) / int(X)

if X=="1" or int(c) != int(d) or int(a)==X or int(b)==X:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

Solution code:
tmp = input().split()
K = int(tmp[0])

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

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

Submission status: Wrong Answer

Solution code:
k=input()
a,b=map(int,input().split())
result=0
while int(k)<=b:
    if a<=int(k) and int(k)<=b:
        result=result+1

    k=k+k
if result>0:
    print('OK')
else :
    print('NG')

Submission status: Wrong Answer

Solution code:
n = int(input())
m = list(map(int,input().split()))

sa = m[1] - m[0]
flag = 0

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

for x in range(sa):
    hantei = m[0]
    hantei += x
    if hantei % n == 0:
        flag += 1

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

Submission status: Wrong Answer

Solution code:
str1 = int(input())
str2 = input().split()

num = int(str2[1] ) - int(str2[0])
if num == 0:
    num = 1

use = int(str2[1])

ok_count = 0

for i in range(num):
    if use % str1 == 0:
        ok_count = 1
    use = use - 1

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

Submission status: Wrong Answer

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

D = A/K
U = B/K
if( U-D ==0):
  if(A%K == 0 and B%K ==0 ):
    print("OK")
  else:
    print("NG")
elif( U-D > 0):
 print("OK")

else :
 print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = tuple(int(x) for x in input().split())

start = (A // K) * K
# if start % K == 0:
#     import ipdb; ipdb.set_trace()
#     print('OK')
#     exit(0)

if K == 0:
    print('NG')
    exit(0)

if start == B or start + K <= B:
    print('OK')
    exit(0)

print('NG')

Submission status: Wrong Answer

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

for i in range(b):
  i+=1
  ks = k * i 
  ka.append(ks)

if k in ka:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

aa=a//k
bb=b//k

if bb-aa>=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('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

fly=0
l=[]
while fly<b:
    fly += k
    l.append(fly)

print(l)
if l[-1]>=a and l[-1]<=b:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

    
if s == 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 !=0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int,input().split())
n_A = A//K + 1
n_B = B//K
if K == 1:
  print("OK")

if n_B - n_A >= 0:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

# A =< K =< Bの場合
if K >= A and K <= B:
    print('OK')
elif K < (B - A):
    print('OK')
elif K == 1:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
K=int(input())
A,B=(int(x) for x in input().split())
if K-(A%K)<=B-A or K==A:print('OK')
else:print('NG')

Submission status: Wrong Answer

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

if A//K - (B-1)//K > 0:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K=()
A=()
B=()

K=int(input(""))
A, B = map(int, input().split())
V=False
C=K 

for i in range(0,B):
      K=C*i
      print(K)
      if K>=A and K<=B:
            V=True
            break
      else:
            V=False

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

Submission status: Wrong Answer

Solution code:
N = int(input())
 
input_line = input()
Line = input_line.split()
Line = [int(s) for s in Line]

if Line[1] == Line[0] and Line[0]%N == 0:
    print("OK")
    
elif Line[1]-Line[0] < N:
    print("NG")

else:
    print("OK")

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
X = input()
a, b = input().split()

c = int(a) / int(X)
d = int(b) / int(X)

if X=="1" or int(c) != int(d) or int(c)==1 or int(d)==1:
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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

ans = (b / k) - (a / k)

if ans >= 1:
  print('OK')
else:
  print('NG')

Submission status: Wrong Answer

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

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())
	list_a = []
	if b == a:
		print("OK")
		sys.exit()

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

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
a=int(input())
b=list(map(int,input().split()))
ans="No"
for i in range(b[0],b[1]+1):
    if i%a==0:
        ans="Yes"
print(ans)

Submission status: Wrong Answer

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

elif A == B and A%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):
    if i%k==0:
        print("OK")
        break
print("NG")

Submission status: Wrong Answer

Solution code:
K = int(input())
A, B = map(int, input().split( ))
Res = int(A)
M = 0
while Res <= B:
    if Res % K == 0:
        print("OK")
        M = 1

        break
    Res += 1

if M == 0:
    print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

c = list(range(a // k, b // k))[1:]

print("OK" if a / k == b / k or len(c) > 0 else "NG")

Submission status: Wrong Answer

Solution code:
k=int(input())
a,b=map(int,input().split())
t=a//k
if a%k==0:
    k-=1
n=t*k+k
if n>=a and n<=b:
    print("OK")
else:
    print("NG")

Submission status: Wrong Answer

Solution code:
N = input()
A=input().split()

s=int(A[0])//int(N)
if (s+1)*N>A[1]:
    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")
    
else:
  print("NG")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if K==1:
    print('OK')
elif B/K-A/K>=1:
    print('OK')
elif B%K==0:
    print('OK')
elif A%K==0:
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
n = int(input())
a,b = map(int,input().split())
if (b-a+1) >=n:
  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")
    exit()
else:
    if B-A>=K-1:
        print("OK")
    else:
        print("NO")

Submission status: Wrong Answer

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

tmp = A % K
flg = 0
while((tmp*K) <= B):

    if(A <= (tmp* K) <= B):
        flg = 1
        break
    tmp += 1
    
if(flg == 1):
    print('OK')
else:
    print('NG')

Submission status: Wrong Answer

Solution code:
#---We Love Golf

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

judge = b - a

q, mod = divmod(judge,K)

if(q >= 1 or b == K):
  print("OK")
else:
  print("NG")

Submission status: Wrong Answer

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