#include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define ll2(x, y) ll x, y; cin >> x >> y;
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z) cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)

int f[14][14] = {0};
int dx[9] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
int dy[9] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
int gx[12] = {-2, -2, -2, -1, -1, 0, 0, 1, 1, 2, 2, 2};
int gy[12] = {-1, 0, 1, -2, 2, -2, 2, -2, 2, -1, 0, 1};

signed main(void){
  int i, j;
  for(int testcase = 0;testcase >= 0;testcase++){
    int2(px, py);
    if(!(px | py))break;

    rep(i, 14)rep(j, 14)f[i][j] = -1;
    f[px + 2][py + 2] = 0;

    int(n);
    int q, k, l;
    rep(q, n){
      int2(x, y);
      for(i = 2;i < 12;++i)for(j = 2;j < 12;++j)if(f[i][j] == q)
      rep(k, 9)rep(l, 12)if(x + dx[k] == i + gx[l] - 2 && y + dy[k] == j + gy[l] - 2)
      f[i + gx[l]][j + gy[l]] = q + 1;
    }

    bool is = false;
    for(i = 2;i < 12;++i)for(j = 2;j < 12;++j)if(f[i][j] == n)is = true;
    puts(is ? "OK" : "NA");
    /*rep(i, 14){
      rep(j, 14)printf("%3d ", f[j][i]);
      kara;
    }*/


//*/

//*/ break;
  }
  return 0;
}