#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<str<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

int main(void){
	string a,b;
	cin>>a>>b;
	
	if((a.size()!=1&&a[0]=='0')||(b.size()!=1&&b[0]=='0'))pe("NG");
	re(i,a.size()) if(!bw('0',a[i],'9'))pe("NG");
	re(i,b.size()) if(!bw('0',b[i],'9'))pe("NG");
	if(atoi(a.c_str())<=12345&&atoi(b.c_str())<=12345)pe("OK");
	else pe("NG");
	return 0;
}