#ifdef LOCAL
    #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair

ll SUM(VI& V){
  return accumulate(ALL(V), 0LL);
}

void print_vector(VI& V){
  ll n = V.size();
  rep(i, n){
    if(i) cout << ' ';
    cout << V[i];
  }
  cout << endl;
}

ll gcd(ll a,ll b){
    if(b == 0) return a;
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){
    ll g = gcd(a,b);
    return a / g * b;
}

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

const int W=1000;
ll M[W][W]; // obstacle
ll d[W][W]; // distance
void reset(){
  rep(i,W){
    rep(j,W){
      M[i][j]=0;
      d[i][j]=-1;
    }
  }
}

int dx[6] = {1, 0,-1,-1,0,1};
int dy[6] = {0,-1,-1, 0,1,1};

ll manhattan_dist(ll x0, ll y0, ll x1, ll y1){
  ll xdiff = abs(x0-x1);
  ll ydiff = abs(y0-y1);
  return xdiff + ydiff;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll T,N;

    while(cin>>T>>N){
      if(N==0 && T==0) return 0;
      reset();
      VI X(N);
      VI Y(N);
      rep(i,N){
        cin>>X[i]>>Y[i];
      }

      ll sx,sy;cin>>sx>>sy;

      // sx, syからの相対距離で考える
      rep(i, N){
        X[i] -= sx;
        Y[i] -= sy;
      }
      sx=0;
      sy=0;

      sx+=W/2;
      sy+=W/2;

      debug(sx,sy);

      rep(i,N){
        ll x = X[i] + W/2;
        ll y = Y[i] + W/2;
        if(manhattan_dist(sx, sy, x, y)>100){
          continue;
        }else{
          M[y][x] = 1;
        }
      }

      queue<PII> que;
      que.push(MP(sy,sx));
      d[sy][sx] = 0;
      while(!que.empty()){
        auto pa = que.front(); que.pop();
        ll y = pa.first;
        ll x = pa.second;
        if(d[y][x]>=30) continue;

        rep(i,6){
          ll ty = y + dy[i];
          ll tx = x + dx[i];
          if(d[ty][tx]==-1 && M[ty][tx]==0){
            // まだ行ってなくて障害物もない
            d[ty][tx] = d[y][x] + 1;
            que.push(MP(ty,tx));
          }
        }
      }

      ll cnt=0;
      rep(i, W){
        rep(j, W){
          if(d[i][j]!=-1 && d[i][j]<=T) cnt++;
        }
      }
      p(cnt);
    }    
    return 0;
}


Measured memory_bytes: 18860