Problem:
Score: 100 points

Problem Statement

Takahashi the Jumbo will practice golf.

His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).

If he can achieve the objective, print OK; if he cannot, print NG.

Constraints

All values in input are integers.

1 \leq A \leq B \leq 1000

1 \leq K \leq 1000

Input

Input is given from Standard Input in the following format:

K
A B

Output

If he can achieve the objective, print OK; if he cannot, print NG.

Sample Input 1

7
500 600

Sample Output 1

OK

Among the multiples of 7, for example, 567 lies between 500 and 600.

Sample Input 2

4
5 7

Sample Output 2

NG

No multiple of 4 lies between 5 and 7.

Sample Input 3

1
11 11

Sample Output 3

OK

Solution in Python (3.8.2) (judge verdict: Runtime Error)


#提出時にコメントアウトを外す。
k = int(input())
#ab = [input().split() for l in range(2)]
for _ in range(2):
  ab = list(int(input().split()))



#作業用。ここは、作業最後に、コメントアウトする。
k = 1
ab = [11, 11]


#kの倍数をリストに格納する。
k_times = []
for i in range(1, 1000):
    m = i * k
    if m > 1000:
        break
    k_times.append(m)
#print(k_times)

#aからbの連続数リストを作る。
ab_list = []
a = ab[0]
b = ab[1]
for j in range(a , b):
    ab_list.append(j)
if a == b:
    ab_list.append(a)
#print(ab_list)

k_ab_and = set(k_times) & set(ab_list)

#lenのチェック用
#print(len(k_ab_and))

num_result = len(k_ab_and)

if num_result > 0:
    print('OK')

elif num_result == 0:
    print('NG')