Go: package main

import (
	"fmt"
)

func main() {
	for {
		var d, w, h, n int
		// var p1, p2, p3 float64
		var p1, p2, p3 int
		fmt.Scanf("%d %d %d", &d, &w, &h)

		if d == 0 && w == 0 && h == 0 {
			return
		} else {
			// p1 = math.Hypot(float64(d), float64(w))
			// p2 = math.Hypot(float64(w), float64(h))
			// p3 = math.Hypot(float64(d), float64(h))
			p1 = (d * d) + (w * w)
			p2 = (w * w) + (h * h)
			p3 = (d * d) + (h * h)
		}

		// fmt.Println("len:", p1, p2, p3)

		fmt.Scanf("%d", &n)
		for i := 0; i < n; i++ {
			var r int
			fmt.Scanf("%d", &r)

			if p1 < (r*2)*(r*2) || p2 < (r*2)*(r*2) || p3 < (r*2)*(r*2) {
				fmt.Println("OK")
			} else {
				fmt.Println("NA")
			}
		}
	}
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;

int main() {
  int n;

  while(1) {
    vector<float> che(3, 0);
    cin >> che[0] >> che[1] >> che[2];
    if(che[0] == 0.0 && che[1] == 0.0 && che[2] == 0.0) break;
    cin >> n;

    sort(che.begin(), che.end());

    int r[10000] = {0};
    for(int i = 0; i < n; i++) {
      cin >> r[i];
      if((r[i]*r[i]*4) > ((che[0]*che[0])+(che[1]*che[1])))
        cout <<	"OK" <<	endl;
      else
        cout <<	"NA" <<	endl;
    }
    che.clear();
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;

#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)

int r;
bool ok(int a, int b) {
	double c = pow(a, 2.0) + pow(b, 2.0);
	if(c < pow(r * 2, 2.0)) return true;
	else return false;
}
int main() {
	int n, m, k, s;
	while(cin >> n >> m >> k && (n || m || k)) {
		cin >> s;
		rep(i,s) {
			cin >> r;
			if(ok(n, m) || ok(m, k) || ok(k, n)) {
				cout << "OK" << endl;
			} else cout << "NA" << endl;
		}
	}
	return 0;
}

C++: #include <iostream>
using namespace std;

int main() {
  long long int a,b,c,n,r;
  while(cin >> a >> b >> c) {
    if((a==0)&&(b==0)&&(c==0)) break;
    cin >> n;
    for(int i=0;i<n;i++) {
      cin >> r;
      if((a*a + b*b < 4*r*r) || (b*b + c*c < 4*r*r) || (c*c + a*a < 4*r*r)) {
        cout << "OK" << endl;
      }
      else
        cout << "NA" << endl;
    }
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(long long i=0;i<n;i++)
#define REP(i,s,n) for(long long i=(s);i<=(n);i++)
#define repr(i,n) for(long long i=n-1;i>=0;i--)
#define REPR(i,s,n) for(long long i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(unique(all(v)),v.end())
#define Eback(s) s.erase(s.end()-1,s.end())
#define rev(v) reverse(all(v))
#define minvec(v) *min_element(all(v))
#define maxvec(v) *max_element(all(v))
#define sumvec(v) accumulate(all(v),0LL)
#define mapmin(v) v.rbegin()->first
#define mapmax(v) v.begin()->first
#define pb push_back
#define pf push_front
#define m_p make_pair
#define DOUBLE fixed << setprecision(15)
#define OK cerr<<"OK\n"
#define OK1 cerr<<"OK1\n"
#define OK2 cerr<<"OK2\n"
#define sz(s) (long long)s.size()
#define INF ((1LL<<62)-(1LL<<31))
#define zero(x,n) setw(x) << setfill('0') << n
#define endl '\n'

typedef long long ll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;

typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<ll,ll>> vpll;

const double pi = acos(-1.0);
const ll mod=1000000007;
//const ll mod=998244353;

template<class A, class B>
ostream& operator<<(ostream& ost, const pair<A, B>&p) {
	ost << "{" << p.first << ", " << p.second << "} ";
	return ost;
}

template<class T>
ostream& operator<<(ostream& ost, const vector<T>&v) {
	ost << "{";
	for (int i = 0; i<(int)v.size(); i++) {
		if (i)ost << " ";
		ost << v[i];
	}
	ost << "} \n";
	return ost;
}

template<class A, class B>
ostream& operator<<(ostream& ost, const map<A, B>&v) {
	ost << "{";
	for (auto p:v) {
		ost << "{" << p.first << ", " << p.second << "} ";
	}
	ost << "} ";
	return ost;
}

void out(){cout << "\n";}
template<class T,class... Args>
void out(const T &x,const Args &... args){
	cout << x << " ";
	out(args...);
}

template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
	for(T& e: vec) is >> e;
	return is;
}

template<typename T>
string join(vector<T>& vec, string sep=" "){
	stringstream ss;
	for(int i=0;i<(int)vec.size();i++){
		ss << vec[i] << (i+1==(int)vec.size()?"\n":sep);
	}
	return ss.str();
}

template<class T>
inline bool chmax(T& a, T b){if(a<b){a=b;return true;} return false;}

template<class T>
inline bool chmin(T& a, T b){if(a>b){a=b;return true;} return false;}

void YES(bool b) {cout << ((b)?"YES\n":"NO\n");}
void Yes(bool b) {cout << ((b)?"Yes\n":"No\n");}
void yes(bool b) {cout << ((b)?"yes\n":"no\n");}
void Yay(bool b) {cout << ((b)?"Yay!\n":":(\n");}

ll powmod(ll a,ll b){ll c=1; while(b>0){ if(b&1){ c=a*c%mod; } a=a*a%mod; b>>=1; } return c;}
ll invmod(ll a){ return powmod(a,mod-2); }
ll nCrmod(ll n,ll r){ll x=1,y=1; for(ll i=0;i<r;i++) {x=x*(n-i)%mod; y=y*(i+1)%mod; } return x*powmod(y,mod-2)%mod;}
ll gcd(ll x, ll y) {return __gcd(x,y);}
ll lcm(ll x, ll y) {return x/__gcd(x,y)*y;}

int main()
{
	while(1){
		double d,w,h;
		cin >> d >> w >> h;
		if(!d && !w && !h) break;
		ll n;
		cin >> n;
		rep(i,n){
			double r;
			cin >> r;
			bool frag=false;
			if(sqrt(d*d+w*w)<2*r || sqrt(d*d+h*h)<2*r || sqrt(h*h+w*w)<2*r) frag=true;
			if(frag) cout << "OK\n";
			else cout << "NA\n";
		}
	}
	return 0;
}

C++: #include<iostream>
#include<math.h>
using namespace std;
int main(){

  int t,y,h,k,i,n,r;
  double c;
  while(cin>>t>>y>>h){
    if(t==0&&y==0&&h==0)break;
    if(t<y){
      n=t;
      t=y;
      y=n;
    }
    if(y<h){
      n=t;
      t=y;
      y=n;
    }
    if(t<y){
      n=t;
      t=y;
      y=n;
    }
    c=sqrt((t/2)*(t/2)+(y/2)*(y/2));
    cin>>k;
    for(i=0;i<k;i++){
      cin>>r;
      if(r>c){
	cout<<"OK"<<endl;
      }
      else{
	cout<<"NA"<<endl;
      }
    }
  }
  return 0;
}

C++: #include<stdio.h>
#include<math.h>
#define M(a,b) (a<b?a:b)
#define S(a,b) sqrt(a*a+b*b)
int main(){
	for(int a,b,c,n,r;scanf("%d%d%d",&a,&b,&c),a|b|c;){
		for(scanf("%d",&n);n--;){
			scanf("%d",&r);
			puts(
				(2*r>M(M(S(a,b),S(b,c)),S(c,a)))?
				"OK":"NA"
			);
		}
	}
}

C++: #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;

int main(){

  int cheeze[3], n, r, hole;
  double d;

  while(cin >> cheeze[0] >> cheeze[1] >> cheeze[2]){
    if(cheeze[0] == 0) break;
    cin >> n;

    sort(cheeze, cheeze+3);
    r = cheeze[0] * cheeze[0] + cheeze[1] * cheeze[1];
    d = (double)cheeze[0] * cheeze[1];
    d = d * d / r;

    for(int i=0; i<n; i++){
      cin >> hole;
      if(4 * hole * hole > r && (double)hole * hole > d) cout << "OK" << endl;
      else cout << "NA" << endl;
    }
  }

  return 0;

}

C++: #include <algorithm>
#include <cmath>
#include <iostream>

using namespace std;

int main() {

	double c[3];

	while(cin >> c[0] >> c[1] >> c[2]) {
		if(!c[0]&&!c[1]&&!c[2]) {
			break;
		}
		sort(c, c+2);
		double R=sqrt(pow(c[0], 2)+pow(c[1], 2));

		int n;
		cin >> n;
		while(n) {
			int r;
			cin >> r;
			cout << (2*r>R ? "OK" : "NA") << endl;
			n--;
		}
	}

	return 0;

}