#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

template<class T> constexpr bool in_range(T y, T x, T H, T W) { return -H<=y&&y<H&&-W<=x&&x<W; }

typedef long long ll;
int const inf = 1<<29;

ll const MaxSize = 301;

//vector<vector<bool>> vis;
set<pair<int, int>> vis;

void solve(ll q, ll p, int h, int w) {

  vis.clear();

  ll const dx[] = {p,p,-p,-p,q,q,-q,-q};
  ll const dy[] = {q,-q,q,-q,p,-p,p,-p};

  queue<pair<ll, ll>> Q;
  Q.emplace(0, 0);
  vis.insert({0, 0});

  while(!Q.empty()) {
    auto const prev = Q.front(); Q.pop();
    auto const y = prev.first, x = prev.second;
    rep(k, 8) {
      auto const ny = y + dy[k], nx = x + dx[k];
      if(!in_range(y, x, (ll)h, (ll)w)) { continue; }
      if(vis.count({ny, nx})) { continue; }
      vis.insert({ny, nx});
      Q.emplace(ny, nx);
    }
  }
}

int main() {

  ll p, q; cin >> p >> q;
//  ll g = __gcd(p, q);
  ll N; cin >> N;
  solve(q, p, MaxSize, MaxSize);
  auto& small_case = vis;
/*
  REP(i, -10, 21) {
    REP(j, -10, 21) {
      if(small_case.count({i, j})) {
        cout << "#";
      }
      else {
        cout << ".";
      }
    }
    cout << endl;
  }
*/
  int ans = 0;

  rep(i, N) {
    ll x, y; cin >> x >> y;
    if(x < MaxSize && y < MaxSize) {
      ans += small_case.count({y, x});
    }
    else {
      if((p + q) % 2) {
        ans ++;
      }
      else {
        if((x + y) % 2 == 0) {
          ans ++;
        }
      }
    }
  }

  cout << ans << endl;

  return 0;
}