#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int gcd(int a, int b) {
    return b == 0 ? a : gcd(b,a%b);
}

int main(void) {
    int i, p, q, n;
    scanf("%d %d %d",&p,&q,&n);
    int ans = 0;
    while (n--) {
        int x, y;
        scanf("%d %d",&x,&y);
        if (p == 0 || q == 0) {
            if (p == 0 && q == 0)
                ans += x == 0 && y == 0;
            else if (p == 0)
                ans += x % q == 0 && y % q == 0;
            else
                ans += x % p == 0 && y % p == 0;
            continue;
        }
        if (x % gcd(p,q) != 0 || y % gcd(p,q) != 0) continue;
        x /= gcd(p,q);
        y /= gcd(p,q);
        x = (x%2+2)%2;
        y = (y%2+2)%2;
        if (x == y || p / gcd(p,q) % 2 != q / gcd(p,q) % 2)
            ans++;
    }
    printf("%d\n",ans);
    return 0;
}