#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
const ll MOD=1e9+7;

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  ll p,q;
  cin>>p>>q;
  ll g=p+q;
  if(p && q){
    if(p!=q)g=__gcd(g,abs(p-q));
    g=__gcd(g,2*__gcd(p,q));
  }  

  if(!g){
  int n;
  cin>>n;
  ll x,y,re=n;
  rep(i,n){
    cin>>x>>y;
    if(x || y) --re;
  }
  cout<<re<<endl;
    return 0;
  }

  int n;
  cin>>n;
  ll x,y,re=n;
  rep(i,n){
    cin>>x>>y; 
    int f=0;
    for(ll d:{0ll,p,q}){
      ll xx=abs(x-d),yy=abs(y-d);
      if(xx%g==0 && yy%g==0) f=1;
    }
    if(!f) --re;
  }
  cout<<re<<endl;
  return 0;
}