#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
const int dx2[] = { -2, -2, -1, 0,1,2,2,2,1,0,-1,-2 }; const int dy2[] = { 0, -1, -2, -2,-2,-1,0,1,2,2,2,1 };
int main() {
	int x, y;
	while (cin >> x >> y, x | y){
		int n;
		cin >> n;
		queue<int> qi;
		qi.push(x * 10 + y);
		REP(i, n){
			queue<int> qi2;
			int x2, y2;
			cin >> x2 >> y2;
			while (!qi.empty()){
				int pos = qi.front(); qi.pop();
				int x3 = pos / 10, y3 = pos % 10;
				REP(j, 3){
					REP(k, 3){
						if (x2 + j - 1 >= 0 && x2 + j - 1 < 10 && y2 + k - 1 >= 0 && y2 + k - 1 < 10){
							REP(l, 12){
								if (x2 + j - 1 == x3 + dx2[l] && y2 + k - 1 == y3 + dy2[l])
									qi2.push((x3 + dx2[l]) * 10 + y3 + dy2[l]);
							}
						}
					}
				}
			}
			if (qi2.size() > 0){
				qi = qi2;
			}
			else{
				break;
			}
		}
		if (qi.size() > 0)
			cout << "OK"<< endl;
		else
			cout << "NA" << endl;
	}
}