#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 1;
long long gcd(long long a, long long b) {
  long long r;
  while (b > 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
int main() {
  long long n, k, a, b, maxkq = 0, minkq = 1e18, l, kq, g, tmp;
  cin >> n >> k >> a >> b;
  tmp = n * k;
  for (int i = 0; i < n; i++) {
    l = (k * i + a - b) % tmp;
    if (l < 0) l += n * k;
    g = gcd(l, n * k);
    kq = (n * k) / g;
    if (kq < minkq) minkq = kq;
    if (kq > maxkq) maxkq = kq;
    l = (k * i + a + b) % tmp;
    g = gcd(l, n * k);
    kq = (n * k) / g;
    if (kq < minkq) minkq = kq;
    if (kq > maxkq) maxkq = kq;
    l = (k * i - a + b) % tmp;
    if (l < 0) l += n * k;
    g = gcd(l, n * k);
    kq = (n * k) / g;
    if (kq < minkq) minkq = kq;
    if (kq > maxkq) maxkq = kq;
    l = (k * i - a - b) % tmp;
    if (l < 0) l += n * k;
    g = gcd(l, n * k);
    kq = (n * k) / g;
    if (kq < minkq) minkq = kq;
    if (kq > maxkq) maxkq = kq;
  }
  cout << minkq << " " << maxkq;
  return 0;
}
