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 Rust (1.42.0) (judge verdict: Accepted)

fn main() {
    let (k, a, b) = read();
    let ans = solve(k, a, b);
    write(if ans {"OK"} else {"NG"});
}

fn read() -> (u32, u32, u32) {
    let mut l1 = String::new();
    std::io::stdin().read_line(&mut l1).ok();
    let k: u32 = l1.trim().parse().unwrap();
    let mut l2 = String::new();
    std::io::stdin().read_line(&mut l2).ok();
    let mut iter = l2.trim().split_whitespace();
    let a: u32 = iter.next().unwrap().parse().unwrap();
    let b: u32 = iter.next().unwrap().parse().unwrap();

    (k, a, b)
}

fn write(s: &str) {
    println!("{}", s);
}

fn solve(k: u32, a: u32, b: u32) -> bool {
    for i in a..=b {
        if i % k == 0 {
            return true;
        }
    }

    return false;
}