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

using namespace std;



bool solve(int k, int a, int b){

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

		if (i % k == 0)

			return true;

	return false;

}



int main(){

	int k, a, b;

	cin >> k;

	cin >> a >> b;

	cout << (solve(k,a,b) ? "OK" : "NG");

}


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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

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

using namespace std;

int main()

{

    int k,a,b,ans;

    cin>>k>>a>>b;

    ans = b/k - (a-1)/k;

    if(ans) cout<<"OK"<<endl;

    else cout<<"NG"<<endl;

}


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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

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

using namespace std;

int main()

{

    int K,A,B,i;

    cin>>K>>A>>B;

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

    {

        if(i%K==0)

        {

            cout<<"OK";

            return 0;

        }



    }

    cout<<"NG";

    return 0;

}


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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

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



using namespace std;

int main(void)

{

    short int K,A,B,count=0;

    cin>>K;

    cin>>A>>B;



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

    {

        if(i%K==0)

        {

            count=1;

            break;

        }

    }





    if(count==1) cout<<"OK"<<endl;

    else cout<<"NG"<<endl;



}

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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

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

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

using namespace std;



typedef long long ll;

typedef pair<int,int> ii;

typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;



int main() {

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

	int k,a,b; cin>>k>>a>>b;

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

		if (i%k==0) {   

			cout<<"OK"<<endl;

			return 0;

		}

	}

	cout<<"NG"<<endl;

	return 0;

}


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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

}
// Slower C++ solution:
//

//	Created by shamim_nik

//



#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

using namespace std;



typedef long long ll;

typedef tree<int,null_type,less<int>,rb_tree_tag,

		tree_order_statistics_node_update> indexed_set;



#define br printf("\n")



int main () {

	ios::sync_with_stdio(0);

	cin.tie(0);



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

//	freopen("output.txt", "w", stdout);



	int a, b, k;

	cin >> k >> a >> b;

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

		if(i % k == 0) {

			cout << "OK" << endl;

			return 0;

		}

	}

	cout << "NG" << endl;

	return 0;

}

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



int main(){

	int n;

	scanf("%d", &n);

	int T, K;

	scanf ("%d %d", &T, &K);

	

	for (int i = T; i <= K; i++){

		if (i % n == 0){

			puts("OK");

			return 0;

		}

		else continue;

	}

	puts("NG");

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



using namespace std;



int main() {

    int k,a,b,v;

    cin>>k>>a>>b;

    for(v=0;v<=b;v=v+1){

        if(v%k==0){

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

                cout<<"OK"<<"\n";

                return 0;

            }

        }

    }

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

    return 0;

}

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



int main() {

	int a, b;

	int k;

	

	scanf("%d", &k);

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

	

		

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

		

		int c;

		c = a%k;

		

		if(c != 0 && a <= b) {

			a++;

			continue;

		}

		if(c == 0 && a <= b) {

			printf("OK\n");

			return 0;

			

		}

	}

	printf("NG\n");

	return 0;

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

using namespace std;

typedef long long int  ll;

const ll mod = 1e9+7;

const ll mod1 = 998244353;

#define rep(i,a,b) for(ll i=a;i<b;i++)



void swap(ll &a , ll &b){

    ll t = a;

    a = b;

    b = t;

}



ll min(ll a, ll b){

    if(a<b)return a;

    return b;

}



ll max(ll a, ll b){

    if(a>b)return a;

    return b;

}



 ll pow(ll a, ll b) {

    a %= mod;

    ll ans = 1;

    while (b > 0) {

        if (b & 1)

            ans = ans * a % mod;

        a = a * a % mod;

        b /= 2;

    }

    return ans;

 }



 int n;

 int visited[102] = {0};

int x[102], y[102];



void dfs(int i)

{

    visited[i] = 1;

    for(int j=0; j<n; j++)

    {

        if(x[j] == x[i] || y[j]==y[i] )

        {

            if(visited[j] == 0)

            {

                dfs(j);

            }

        }

    }

}



int main(){



   ios_base :: sync_with_stdio(0);

   cin.tie(0);



   int a,b,k;

   cin>>k>>a>>b;



   int flag = 0;

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

   {

        if(i%k==0)

        {

            flag = 1;

            cout<<"OK\n";

            break;

        }

   }



    if(flag == 0)

        cout<<"NG\n";



    return 0;



}


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



int main() {

	int a, b;

	int k;

	

	scanf("%d", &k);

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

	

		

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

		

		int c;

		c = a%k;

		

		if(c != 0 && a <= b) {

			a++;

			continue;

		}

		if(c == 0 && a <= b) {

			printf("OK\n");

			return 0;

			

		}

	}

	printf("NG\n");

	return 0;

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

using namespace std;



bool solve(int k, int a, int b){

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

		if (i % k == 0)

			return true;

	return false;

}



int main(){

	int k, a, b;

	cin >> k;

	cin >> a >> b;

	cout << (solve(k,a,b) ? "OK" : "NG");

}


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



int main() {

	int a, b;

	int k;

	

	scanf("%d", &k);

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

	

		

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

		

		int c;

		c = a%k;

		

		if(c != 0 && a <= b) {

			a++;

			continue;

		}

		if(c == 0 && a <= b) {

			printf("OK\n");

			return 0;

			

		}

	}

	printf("NG\n");

	return 0;

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

using namespace std;

int main()

{

    int k,a,b,ans;

    cin>>k>>a>>b;

    ans = b/k - (a-1)/k;

    if(ans) cout<<"OK"<<endl;

    else cout<<"NG"<<endl;

}


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



int main() {

	int a, b;

	int k;

	

	scanf("%d", &k);

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

	

		

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

		

		int c;

		c = a%k;

		

		if(c != 0 && a <= b) {

			a++;

			continue;

		}

		if(c == 0 && a <= b) {

			printf("OK\n");

			return 0;

			

		}

	}

	printf("NG\n");

	return 0;

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

using namespace std;

int main()

{

    int K,A,B,i;

    cin>>K>>A>>B;

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

    {

        if(i%K==0)

        {

            cout<<"OK";

            return 0;

        }



    }

    cout<<"NG";

    return 0;

}


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



int main() {

	int a, b;

	int k;

	

	scanf("%d", &k);

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

	

		

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

		

		int c;

		c = a%k;

		

		if(c != 0 && a <= b) {

			a++;

			continue;

		}

		if(c == 0 && a <= b) {

			printf("OK\n");

			return 0;

			

		}

	}

	printf("NG\n");

	return 0;

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



using namespace std;

int main(void)

{

    short int K,A,B,count=0;

    cin>>K;

    cin>>A>>B;



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

    {

        if(i%K==0)

        {

            count=1;

            break;

        }

    }





    if(count==1) cout<<"OK"<<endl;

    else cout<<"NG"<<endl;



}

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



int main() {

	int a, b;

	int k;

	

	scanf("%d", &k);

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

	

		

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

		

		int c;

		c = a%k;

		

		if(c != 0 && a <= b) {

			a++;

			continue;

		}

		if(c == 0 && a <= b) {

			printf("OK\n");

			return 0;

			

		}

	}

	printf("NG\n");

	return 0;

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

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

using namespace std;



typedef long long ll;

typedef pair<int,int> ii;

typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;



int main() {

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

	int k,a,b; cin>>k>>a>>b;

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

		if (i%k==0) {   

			cout<<"OK"<<endl;

			return 0;

		}

	}

	cout<<"NG"<<endl;

	return 0;

}


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



int main() {

	int a, b;

	int k;

	

	scanf("%d", &k);

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

	

		

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

		

		int c;

		c = a%k;

		

		if(c != 0 && a <= b) {

			a++;

			continue;

		}

		if(c == 0 && a <= b) {

			printf("OK\n");

			return 0;

			

		}

	}

	printf("NG\n");

	return 0;

}
// Slower C++ solution:
//

//	Created by shamim_nik

//



#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

using namespace std;



typedef long long ll;

typedef tree<int,null_type,less<int>,rb_tree_tag,

		tree_order_statistics_node_update> indexed_set;



#define br printf("\n")



int main () {

	ios::sync_with_stdio(0);

	cin.tie(0);



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

//	freopen("output.txt", "w", stdout);



	int a, b, k;

	cin >> k >> a >> b;

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

		if(i % k == 0) {

			cout << "OK" << endl;

			return 0;

		}

	}

	cout << "NG" << endl;

	return 0;

}

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



int main() {

	int a, b;

	int k;

	

	scanf("%d", &k);

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

	

		

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

		

		int c;

		c = a%k;

		

		if(c != 0 && a <= b) {

			a++;

			continue;

		}

		if(c == 0 && a <= b) {

			printf("OK\n");

			return 0;

			

		}

	}

	printf("NG\n");

	return 0;

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



using namespace std;



int main() {

    int k,a,b,v;

    cin>>k>>a>>b;

    for(v=0;v<=b;v=v+1){

        if(v%k==0){

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

                cout<<"OK"<<"\n";

                return 0;

            }

        }

    }

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

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3024654740259605x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

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

using namespace std;

typedef long long int  ll;

const ll mod = 1e9+7;

const ll mod1 = 998244353;

#define rep(i,a,b) for(ll i=a;i<b;i++)



void swap(ll &a , ll &b){

    ll t = a;

    a = b;

    b = t;

}



ll min(ll a, ll b){

    if(a<b)return a;

    return b;

}



ll max(ll a, ll b){

    if(a>b)return a;

    return b;

}



 ll pow(ll a, ll b) {

    a %= mod;

    ll ans = 1;

    while (b > 0) {

        if (b & 1)

            ans = ans * a % mod;

        a = a * a % mod;

        b /= 2;

    }

    return ans;

 }



 int n;

 int visited[102] = {0};

int x[102], y[102];



void dfs(int i)

{

    visited[i] = 1;

    for(int j=0; j<n; j++)

    {

        if(x[j] == x[i] || y[j]==y[i] )

        {

            if(visited[j] == 0)

            {

                dfs(j);

            }

        }

    }

}



int main(){



   ios_base :: sync_with_stdio(0);

   cin.tie(0);



   int a,b,k;

   cin>>k>>a>>b;



   int flag = 0;

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

   {

        if(i%k==0)

        {

            flag = 1;

            cout<<"OK\n";

            break;

        }

   }



    if(flag == 0)

        cout<<"NG\n";



    return 0;



}


// Faster C++ solution for the same problem (measured speedup: 5.375978419110456x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

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

using namespace std;



bool solve(int k, int a, int b){

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

		if (i % k == 0)

			return true;

	return false;

}



int main(){

	int k, a, b;

	cin >> k;

	cin >> a >> b;

	cout << (solve(k,a,b) ? "OK" : "NG");

}


// Faster C++ solution for the same problem (measured speedup: 5.299289104872257x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

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

using namespace std;

int main()

{

    int k,a,b,ans;

    cin>>k>>a>>b;

    ans = b/k - (a-1)/k;

    if(ans) cout<<"OK"<<endl;

    else cout<<"NG"<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.311667784293137x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

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

using namespace std;

int main()

{

    int K,A,B,i;

    cin>>K>>A>>B;

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

    {

        if(i%K==0)

        {

            cout<<"OK";

            return 0;

        }



    }

    cout<<"NG";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.299230506557396x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

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



using namespace std;

int main(void)

{

    short int K,A,B,count=0;

    cin>>K;

    cin>>A>>B;



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

    {

        if(i%K==0)

        {

            count=1;

            break;

        }

    }





    if(count==1) cout<<"OK"<<endl;

    else cout<<"NG"<<endl;



}

// Faster C++ solution for the same problem (measured speedup: 5.312788891945495x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

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

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

using namespace std;



typedef long long ll;

typedef pair<int,int> ii;

typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;



int main() {

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

	int k,a,b; cin>>k>>a>>b;

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

		if (i%k==0) {   

			cout<<"OK"<<endl;

			return 0;

		}

	}

	cout<<"NG"<<endl;

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.383696930202239x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

}
// Slower C++ solution:
//

//	Created by shamim_nik

//



#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

using namespace std;



typedef long long ll;

typedef tree<int,null_type,less<int>,rb_tree_tag,

		tree_order_statistics_node_update> indexed_set;



#define br printf("\n")



int main () {

	ios::sync_with_stdio(0);

	cin.tie(0);



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

//	freopen("output.txt", "w", stdout);



	int a, b, k;

	cin >> k >> a >> b;

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

		if(i % k == 0) {

			cout << "OK" << endl;

			return 0;

		}

	}

	cout << "NG" << endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.383774856232768x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

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

using namespace std;



///******************************** C o n t a i n e r ********************************///



typedef long long ll;

typedef unsigned long long ull;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef pair<int,int> pii;

typedef pair<ll,ll> pll;

typedef vector<pii> vii;

typedef vector<pll> vll;



///*********************************** C o n s t ***********************************///



const int       N=1e6+3;

const double    PI = acos(-1);

const ll        MOD=1000000007;                 ///1e9+7

ll dx[] = {+1, 0, -1, 0, +1, +1, -1, -1};

ll dy[] = {0, +1, 0, -1, +1, -1, +1, -1};



///********************************** M a r c o ***********************************///



#define pb push_back

#define F first

#define S second

#define test int tc; cin>>tc; while(tc--)

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

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

#define all(a) a.begin(),a.end()

#define rall(a) a.rbegin(),a.rend()

#define sz(x) x.size()

#define el <<'\n'

#define sp <<' '

#define print(a) {for(auto x:a)cout<<x<<" ";cout<<endl;}

#define mem(a,b) memset(a, b, sizeof(a))

#define gcd(a,b) __gcd(a,b)

#define lcm(a,b) (a*(b/gcd(a,b)))

#define sqr(a) (a)*(a)



#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);

#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);



///*********************************** F u n c t i o n ***********************************///



ll powmod(ll a,ll b){ll p=MOD;a%=p;if(!a) return 0;ll pr=1;while(b>0){if(b&1){pr*=a;pr%=p;--b;}a*=a;a%=p;b/=2;}return pr;}

bool isPrime(ll n){ if(n<=1)return false;if(n<=3)return true;if(n%2==0 or n%3==0)return false;for(ll i=5;i*i<=n;i+=6){if(n%i==0 or n%(i+2)==0)return false;}return true;}

void seive(bool a[]){ll mx=sqrt(N),ii,jj;for(ii=3;ii<=mx;ii+=2)if(!a[ii])for(jj=ii*ii;jj<=N;jj+=2*ii)a[jj]=true;}

void numofdiv(ll a[]){ll mx=sqrt(N),ii,jj;for(ii=1;ii<=mx;ii++){for(jj=ii*ii;jj<=N;jj+=ii){if(jj==ii*ii) a[jj]++; else a[jj]+=2;}}}

void sumofdiv(ll a[]){ll mx=sqrt(N),ii,jj;for(ii=1;ii<=mx;ii++){for(jj=ii*ii;jj<=N;jj+=ii){if(jj==ii*ii) a[jj]+=ii; else a[jj]+=ii+jj/ii;}}}



///**************************************************** C o d e ****************************************************///

///-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=///







void _case()

{

    ll n,i,m,k;

    string a;

    cin>>k>>n>>m;

    if(n%k==0 or m%k==0) {cout<<"OK" el;

    return;}

    while(n!=m){

        if(n%k==0){cout<<"OK" el; return;}

        n++;

    }

    cout<<"NG" el;

}



main()

{

      fastio();

        _case();



}





///Thank you.





///Brainless_Loco Terminates Here!


// Faster C++ solution for the same problem (measured speedup: 5.372091845819879x):


  #include <stdio.h>



int main ()

{

	int K,A,B;

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

	if((B/K)*K<A){

		printf("NG\n");

	}

	else{

		printf("OK\n");

	

	}

	

	return 0;

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



using namespace std;



int main() {

    int k,a,b,v;

    cin>>k>>a>>b;

    for(v=0;v<=b;v=v+1){

        if(v%k==0){

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

                cout<<"OK"<<"\n";

                return 0;

            }

        }

    }

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

    return 0;

}

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



int main (){

    int K,A,B;

    int sum=0;

    

    scanf("%d",&K);

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

    

    while (sum < B){

        sum += K;

        if (sum >= A){

            break;

        }

    }

    sum > B ? printf("NG\n") : printf("OK\n");

    //condition ? statement T : statement F   

        

    

    return 0;

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

using namespace std;

typedef long long int  ll;

const ll mod = 1e9+7;

const ll mod1 = 998244353;

#define rep(i,a,b) for(ll i=a;i<b;i++)



void swap(ll &a , ll &b){

    ll t = a;

    a = b;

    b = t;

}



ll min(ll a, ll b){

    if(a<b)return a;

    return b;

}



ll max(ll a, ll b){

    if(a>b)return a;

    return b;

}



 ll pow(ll a, ll b) {

    a %= mod;

    ll ans = 1;

    while (b > 0) {

        if (b & 1)

            ans = ans * a % mod;

        a = a * a % mod;

        b /= 2;

    }

    return ans;

 }



 int n;

 int visited[102] = {0};

int x[102], y[102];



void dfs(int i)

{

    visited[i] = 1;

    for(int j=0; j<n; j++)

    {

        if(x[j] == x[i] || y[j]==y[i] )

        {

            if(visited[j] == 0)

            {

                dfs(j);

            }

        }

    }

}



int main(){



   ios_base :: sync_with_stdio(0);

   cin.tie(0);



   int a,b,k;

   cin>>k>>a>>b;



   int flag = 0;

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

   {

        if(i%k==0)

        {

            flag = 1;

            cout<<"OK\n";

            break;

        }

   }



    if(flag == 0)

        cout<<"NG\n";



    return 0;



}


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



int main (){

    int K,A,B;

    int sum=0;

    

    scanf("%d",&K);

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

    

    while (sum < B){

        sum += K;

        if (sum >= A){

            break;

        }

    }

    sum > B ? printf("NG\n") : printf("OK\n");

    //condition ? statement T : statement F   

        

    

    return 0;

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

using namespace std;



bool solve(int k, int a, int b){

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

		if (i % k == 0)

			return true;

	return false;

}



int main(){

	int k, a, b;

	cin >> k;

	cin >> a >> b;

	cout << (solve(k,a,b) ? "OK" : "NG");

}


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



int main (){

    int K,A,B;

    int sum=0;

    

    scanf("%d",&K);

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

    

    while (sum < B){

        sum += K;

        if (sum >= A){

            break;

        }

    }

    sum > B ? printf("NG\n") : printf("OK\n");

    //condition ? statement T : statement F   

        

    

    return 0;

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

using namespace std;

int main()

{

    int k,a,b,ans;

    cin>>k>>a>>b;

    ans = b/k - (a-1)/k;

    if(ans) cout<<"OK"<<endl;

    else cout<<"NG"<<endl;

}


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



int main (){

    int K,A,B;

    int sum=0;

    

    scanf("%d",&K);

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

    

    while (sum < B){

        sum += K;

        if (sum >= A){

            break;

        }

    }

    sum > B ? printf("NG\n") : printf("OK\n");

    //condition ? statement T : statement F   

        

    

    return 0;

}