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 C# (Mono-mcs 6.8.0.105) (judge verdict: Accepted)

// C# program to build the smallest number 
// by removing n digits from a given number 
using System;
using System.Collections.Generic;
using System.Linq;
class GFG
{

    public static void Main(String[] args)
    {
        var n = int.Parse(Console.ReadLine());
        var input = Console.ReadLine().Split(' ');
        var l = int.Parse(input[0]);
        var u = int.Parse(input[1]);
        Golf(n, l, u);
    }

    public static void Golf(int k, int l, int u)
    {

        for (int i = l; i <= u; i++)
        {
            var tmp = i % k;
            if (tmp==0)
            {
                Console.Write("OK");
                Console.WriteLine();
                return;
            }
        }
        Console.Write("NG");
        Console.WriteLine();
    }
}