#include <bits/stdc++.h>
using namespace std;
priority_queue<long long int, vector<long long int>, greater<long long int> >
    ti;
vector<long long int> p[200005], b(200005, 0), d(200005, 0), f;
map<pair<long long int, long long int>, long long int> mp;
set<pair<long long int, long long int> > s;
map<long long int, long long int> np, v;
queue<long long int> q;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int bpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res % 1000000007;
}
long long int fact(long long int i) {
  if (i <= 0)
    return 1;
  else
    return (i * fact(i - 1)) % 1000000007;
}
long long int isprime(long long int n) {
  for (long long int i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return 0;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long double n, m;
  long long int q;
  cin >> n >> m >> q;
  long long int g = n, h = m;
  long long int f = gcd(g, h);
  n /= f;
  m /= f;
  long double a, b, c, d, x, y;
  while (q--) {
    long long int u = 0, v = 0;
    cin >> a >> b >> c >> d;
    if (a == 2) {
      swap(a, c);
      swap(b, d);
    }
    if (a != c) {
      x = b / n;
      y = d / m;
      u = ceil(x);
      v = ceil(y);
    } else if (a == 1 && c == 1) {
      x = b / n;
      y = d / n;
      u = ceil(x);
      v = ceil(y);
    } else if (a == 2 && c == 2) {
      x = b / m;
      y = d / m;
      u = ceil(x);
      v = ceil(y);
    }
    if (u == v)
      cout << "YES"
           << "\n";
    else
      cout << "NO"
           << "\n";
  }
}
