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++ (GCC 9.2.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
#define pb push_back
#define MOD 1000000007
#define pii pair<int,int>
#define LL long long int
using namespace std;










void solve() {
    int k, a, b;
    cin >> k >> a >> b;
    bool flag = false;
    int ans;
    for (int i = a; i <= b; i++)
    {
        if (i % k == 0)
        {
            flag = true;
            break;
        }
    }
    if (flag)
        cout << "OK" << "\n";

    else
        cout << "NG" << "\n";







}




int main()
{


    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}


/*int n, q;
   cin >> n >> q;
   string s;
   cin >> s;
   transform(s.begin(), s.end(), s.begin(), ::tolower);
   int a[26] = {0};
   for (int i = 0; i < s.length(); i++)
   {
       a[s[i] - 'a']++;
   }
   int maxOcc = 0;
   for (int i = 0; i < 26; i++)
       maxOcc = max(maxOcc, a[i]);*/