stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

	int k,a,b;

	cin>>k>>a>>b;

	if(a%k==0||b%k==0){

		cout<<"OK"<<endl;

	}else{

		int x=b-a;

		int y=a%k;

		if(x+y>=k)cout<<"OK"<<endl;

		else cout<<"NG"<<endl;

	}

} 

// Faster C++ solution for the same problem (measured speedup: 5.313408381099461x):
#include<stdio.h>



int main(){

	int kelipatan,batas1,batas2;

	scanf("%d %d %d", &kelipatan,&batas1,&batas2);

	int temp=batas2/kelipatan;

	if(temp*kelipatan>=batas1){

		printf("OK\n");

	}

	else printf("NG\n");

	return 0;

}
// Slower C++ solution:
// /*

// power code taken from geeks for geeks

// */



#include <bits/stdc++.h>

#define MODD 1000000007LL

#define MAX_SIZE 100000000

#define MAX_N 200001

using namespace std;

typedef long long ll;

typedef long double ld;



ll max(ll a,ll b){return a>b?a:b;}

ll min(ll a,ll b){return a<b?a:b;}

double max(double a,double b){return a>b?a:b;}

double min(double a,double b){return a<b?a:b;}



ll modd(ll a){if(a<0LL) return a*-1LL;return a;}

double modd(double a){if(a<0.0) return a*-1.0;return a;}



ll modulo(ll a){return a % MODD; }



ll power(ll k, ll p){

    if (p == 0)

        return 1LL;

 

    ll P = power(k, p/2LL);

    P = (P * P) % MODD;

 

    if (p % 2 == 1)

        P = (P * k) % MODD;

 

    return P;

}





struct p_str{

    ll a,b,c;

};





void swap(ll& s1, ll &s2){

    ll temp=s1;

    s1=s2;

    s2=temp;

}

ll gcd(ll a, ll b){

    if(b==0){

        return a;

    }

    return gcd(b, a%b);

}



void solve(){

    ll k;

    cin>>k;

    ll a, b;

    cin>>a>>b;

    ll i=a;

    while(i<=b){

        if(i%k==0){

            cout<<"OK"<<endl;

            return;

        }

        i++;

    }

    cout<<"NG"<<endl;

}





int main(){





    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    ll t=1;



    // cin>>t;

    

    while(t--){

        solve();

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.379280885490313x):
#include<stdio.h>



int main(){

	int kelipatan,batas1,batas2;

	scanf("%d %d %d", &kelipatan,&batas1,&batas2);

	int temp=batas2/kelipatan;

	if(temp*kelipatan>=batas1){

		printf("OK\n");

	}

	else printf("NG\n");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)

template <typename Arg1>

void __f(const char* name, Arg1&& arg1) {

  cerr << name << " : " << arg1 << "\n";

}

template <typename Arg1, typename... Args>

void __f(const char* na, Arg1&& arg1, Args&&... args) {

  const char* c = strchr(na + 1, ',');

  cerr.write(na, c - na) << " : " << arg1 << " , ";

  __f(c + 1, args...);

}

#define SZ(v) (int)v.size()

#define endl "\n"

#define ALL(v) v.begin(), v.end()

#define UNIQUE(v) sort(ALL(v)),v.erase(unique(ALL(v)),v.end())

typedef long long LL;

typedef pair <int,int> pii;

const double pi = acos(-1.0);

const double eps = 1e-8;

const int inf = 1e9;

const LL INF = 1e18;

const int mod = 1e9 + 7;

const int N = 1e5 + 5;



void solve() {

  int k, a, b;

  cin >> k >> a >> b;

  if (b/k - (a - 1)/k) cout << "OK" << endl;

  else cout << "NG" << endl;

}



int main() {

  ios_base::sync_with_stdio(0); cin.tie(0);

  #ifdef LOCAL

    freopen("input.txt", "r", stdin);

  #endif

  int t = 1;

  for (int tc = 1; tc <= t; tc++) solve();

  return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.370561173754402x):
#include<stdio.h>



int main(){

	int kelipatan,batas1,batas2;

	scanf("%d %d %d", &kelipatan,&batas1,&batas2);

	int temp=batas2/kelipatan;

	if(temp*kelipatan>=batas1){

		printf("OK\n");

	}

	else printf("NG\n");

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,x,y,i=0,m=1;

    cin>>n>>x>>y;

    while(1)

    {

        i++;

        m=n*i;

        if(m>=x && m<=y)

            {

                cout<<"OK";

            return 0;

            }

        if(m>y)

            {

                cout<<"NG";

            return 0;

            }

    }



   return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.299372248626833x):
#include<stdio.h>



int main(){

	int kelipatan,batas1,batas2;

	scanf("%d %d %d", &kelipatan,&batas1,&batas2);

	int temp=batas2/kelipatan;

	if(temp*kelipatan>=batas1){

		printf("OK\n");

	}

	else printf("NG\n");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int a,b,k,c=0;

    cin>>k>>a>>b;

    for(int i=a;i<=b;i++)

    {

        if(i%k==0)

        {

            c=1;

            break;

        }

    }

    if(c==1)

        cout<<"OK\n";

    else

        cout<<"NG\n";

}


// Faster C++ solution for the same problem (measured speedup: 5.2993814336410905x):
#include<stdio.h>



int main(){

	int kelipatan,batas1,batas2;

	scanf("%d %d %d", &kelipatan,&batas1,&batas2);

	int temp=batas2/kelipatan;

	if(temp*kelipatan>=batas1){

		printf("OK\n");

	}

	else printf("NG\n");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

  int a,b,k,x=0;

  cin>>k>>a>>b;

  for(int i=a;i<=b;i++)

  {

      if(i%k==0){

        x=1;

        break;

        }

  }

if(x==1){

cout<<"OK";

}

else{

cout<<"NG";

}

}

// Faster C++ solution for the same problem (measured speedup: 5.299470007509107x):
#include<stdio.h>



int main(){

	int kelipatan,batas1,batas2;

	scanf("%d %d %d", &kelipatan,&batas1,&batas2);

	int temp=batas2/kelipatan;

	if(temp*kelipatan>=batas1){

		printf("OK\n");

	}

	else printf("NG\n");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

// Faster C++ solution for the same problem (measured speedup: 5.223531859655011x):
#include <stdio.h>

#include <string.h>



int main(){

	int A, K, B, C=0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	for(int i=A; i<=B; i++){

		if(i % K == 0){

			C++;

		}

	}

	if(C>0){

		printf("OK\n");

	}else{

		printf("NG\n");

	}

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.301193929354481x):
#include <stdio.h>

#include <string.h>



int main(){

	int A, K, B, C=0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	for(int i=A; i<=B; i++){

		if(i % K == 0){

			C++;

		}

	}

	if(C>0){

		printf("OK\n");

	}else{

		printf("NG\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.280571281242767x):
#include <stdio.h>

#include <string.h>



int main(){

	int A, K, B, C=0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	for(int i=A; i<=B; i++){

		if(i % K == 0){

			C++;

		}

	}

	if(C>0){

		printf("OK\n");

	}else{

		printf("NG\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.293592385482897x):
#include <stdio.h>

#include <string.h>



int main(){

	int A, K, B, C=0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	for(int i=A; i<=B; i++){

		if(i % K == 0){

			C++;

		}

	}

	if(C>0){

		printf("OK\n");

	}else{

		printf("NG\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


// Faster C++ solution for the same problem (measured speedup: 5.280505203299449x):
#include <stdio.h>

#include <string.h>



int main(){

	int A, K, B, C=0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	for(int i=A; i<=B; i++){

		if(i % K == 0){

			C++;

		}

	}

	if(C>0){

		printf("OK\n");

	}else{

		printf("NG\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

// Faster C++ solution for the same problem (measured speedup: 5.2379636503869245x):
#include <stdio.h>

int main(){

int n;

scanf("%d",&n);

int a,b;

scanf("%d %d",&a,&b);

for (a==a;a<=b;a++){

	if(a%n==0){

		printf("OK");

		return 0;

	}

	else{

		continue;

	}

}

printf("NG");

return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.315840288077522x):
#include <stdio.h>

int main(){

int n;

scanf("%d",&n);

int a,b;

scanf("%d %d",&a,&b);

for (a==a;a<=b;a++){

	if(a%n==0){

		printf("OK");

		return 0;

	}

	else{

		continue;

	}

}

printf("NG");

return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295160662857238x):
#include <stdio.h>

int main(){

int n;

scanf("%d",&n);

int a,b;

scanf("%d %d",&a,&b);

for (a==a;a<=b;a++){

	if(a%n==0){

		printf("OK");

		return 0;

	}

	else{

		continue;

	}

}

printf("NG");

return 0;

}
// Slower C++ solution:
#include<iostream>

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.308217742344871x):
#include <stdio.h>

int main(){

int n;

scanf("%d",&n);

int a,b;

scanf("%d %d",&a,&b);

for (a==a;a<=b;a++){

	if(a%n==0){

		printf("OK");

		return 0;

	}

	else{

		continue;

	}

}

printf("NG");

return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


// Faster C++ solution for the same problem (measured speedup: 5.295094402351034x):
#include <stdio.h>

int main(){

int n;

scanf("%d",&n);

int a,b;

scanf("%d %d",&a,&b);

for (a==a;a<=b;a++){

	if(a%n==0){

		printf("OK");

		return 0;

	}

	else{

		continue;

	}

}

printf("NG");

return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

// Faster C++ solution for the same problem (measured speedup: 5.223531859655011x):
#include<stdio.h>

 

int main()

{

	int K, A, B, i;

	int start= 0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	

	for (i = A; i <= B; i++)

	{

		if (i % K == 0)

		{

			start++;

		}

	}

	

	if (start > 0)

	{

		printf("OK\n");

	}

	

	else

	{

		printf("NG\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.301193929354481x):
#include<stdio.h>

 

int main()

{

	int K, A, B, i;

	int start= 0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	

	for (i = A; i <= B; i++)

	{

		if (i % K == 0)

		{

			start++;

		}

	}

	

	if (start > 0)

	{

		printf("OK\n");

	}

	

	else

	{

		printf("NG\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.280571281242767x):
#include<stdio.h>

 

int main()

{

	int K, A, B, i;

	int start= 0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	

	for (i = A; i <= B; i++)

	{

		if (i % K == 0)

		{

			start++;

		}

	}

	

	if (start > 0)

	{

		printf("OK\n");

	}

	

	else

	{

		printf("NG\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.293592385482897x):
#include<stdio.h>

 

int main()

{

	int K, A, B, i;

	int start= 0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	

	for (i = A; i <= B; i++)

	{

		if (i % K == 0)

		{

			start++;

		}

	}

	

	if (start > 0)

	{

		printf("OK\n");

	}

	

	else

	{

		printf("NG\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


// Faster C++ solution for the same problem (measured speedup: 5.280505203299449x):
#include<stdio.h>

 

int main()

{

	int K, A, B, i;

	int start= 0;

	scanf("%d", &K);

	scanf("%d %d", &A, &B);

	

	for (i = A; i <= B; i++)

	{

		if (i % K == 0)

		{

			start++;

		}

	}

	

	if (start > 0)

	{

		printf("OK\n");

	}

	

	else

	{

		printf("NG\n");

	}

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

// Faster C++ solution for the same problem (measured speedup: 5.238516474993941x):
#include <stdio.h>



int main()

{

    int k, a, b;

    scanf("%d",&k);

    scanf("%d%d", &a, &b);

    for (int i=a; i<=b; i++){

        if(i % k== 0){

            printf("OK\n");

            return 0;

        } else {

            continue;

        }

    }

    printf("NG\n");

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.3164013319324175x):
#include <stdio.h>



int main()

{

    int k, a, b;

    scanf("%d",&k);

    scanf("%d%d", &a, &b);

    for (int i=a; i<=b; i++){

        if(i % k== 0){

            printf("OK\n");

            return 0;

        } else {

            continue;

        }

    }

    printf("NG\n");

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.29571952414531x):
#include <stdio.h>



int main()

{

    int k, a, b;

    scanf("%d",&k);

    scanf("%d%d", &a, &b);

    for (int i=a; i<=b; i++){

        if(i % k== 0){

            printf("OK\n");

            return 0;

        } else {

            continue;

        }

    }

    printf("NG\n");

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<math.h>

#define pi 2*acos(0)

int main()

{

    int a,b,c;

    int x=0;

    std::cin>>a>>b>>c;



    x = c/a;

    if(a*x>= b){

        std::cout<<"OK"<<std::endl;

    }

    else{

        

        std::cout<<"NG"<<std::endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.308777981701849x):
#include <stdio.h>



int main()

{

    int k, a, b;

    scanf("%d",&k);

    scanf("%d%d", &a, &b);

    for (int i=a; i<=b; i++){

        if(i % k== 0){

            printf("OK\n");

            return 0;

        } else {

            continue;

        }

    }

    printf("NG\n");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



typedef long long ll;



main()

{

    int a, b, k, i;

    cin >> k >> a >> b;

    for(i = a; i <=b; i++){

        if(i % k == 0){

            cout << "OK";

            break;

        }

    }

    if(i == b+1){

        cout << "NG";

    }







}











///promy_pompom

//hello world


// Faster C++ solution for the same problem (measured speedup: 5.295653256645847x):
#include <stdio.h>



int main()

{

    int k, a, b;

    scanf("%d",&k);

    scanf("%d%d", &a, &b);

    for (int i=a; i<=b; i++){

        if(i % k== 0){

            printf("OK\n");

            return 0;

        } else {

            continue;

        }

    }

    printf("NG\n");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	int k,a,b;

	cin>>k>>a>>b;

	if(b/k-a/k!=0||a%k==0)

		puts("OK");

	else

		puts("NG");

}

// Faster C++ solution for the same problem (measured speedup: 5.23794268399093x):
#include <stdio.h>

int main() {

    int k, a, b, flag = 0;

    scanf("%d", &k);

    scanf("%d %d", &a, &b);

    for (int i = 1; i <= b; i++) {

        int test = k * i;

        if (test >= a && test <= b) {

            flag = 1;

            break;

        }

    }

    if (flag) {

        printf("OK");

    } else {

        printf("NG");

    }

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pop_b pop_back

#define pf push_front

#define pop_f pop_front



typedef long long ll;

typedef pair<ll,ll> ii;

typedef long double ld; 

typedef vector<int> vi;



#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



#define rep(i, n) for (ll i = 0; i < (n); i++)

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)



int main()

{

	int k, a, b;

	cin>>k>>a>>b;

	int p = (a)/k;

	cout<<(k*(p + (a%k ? 1 : 0)) <= b ? "OK" : "NG")<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.315819009958778x):
#include <stdio.h>

int main() {

    int k, a, b, flag = 0;

    scanf("%d", &k);

    scanf("%d %d", &a, &b);

    for (int i = 1; i <= b; i++) {

        int test = k * i;

        if (test >= a && test <= b) {

            flag = 1;

            break;

        }

    }

    if (flag) {

        printf("OK");

    } else {

        printf("NG");

    }

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a, b, k, i;

    cin>>k>>a>>b;

    for(i=a; i<=b; i++)

    {

        if(i%k==0)

        {

             cout<<"OK";

           return 0;

        }

    }

     cout<< "NG"<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295139467514405x):
#include <stdio.h>

int main() {

    int k, a, b, flag = 0;

    scanf("%d", &k);

    scanf("%d %d", &a, &b);

    for (int i = 1; i <= b; i++) {

        int test = k * i;

        if (test >= a && test <= b) {

            flag = 1;

            break;

        }

    }

    if (flag) {

        printf("OK");

    } else {

        printf("NG");

    }

}