#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a < b) return (gcd(b, a));
  if (b == 0) return (a);
  if (a % b == 0)
    return (b);
  else
    return (gcd(b, a % b));
}
int main() {
  long long n, k, a, b;
  cin >> n >> k >> a >> b;
  long long mi = n * k;
  long long ma = 0;
  long long p = (a + b) % k;
  long long q = (a - b);
  long long r = (b - a);
  long long s = (-a - b);
  while (p < k) p += k;
  while (q < k) q += k;
  while (r < k) r += k;
  while (s < k) s += k;
  p = p % k;
  q = q % k;
  r = r % k;
  s = s % k;
  long long v[4];
  v[0] = p;
  v[1] = q;
  v[2] = r;
  v[3] = s;
  for (long long i = 0; i <= n; i++) {
    for (long long j = 0; j < 4; j++) {
      long long l = i * k + v[j];
      if ((l == 0) || (l > n * k)) continue;
      long long t = (n * k) / gcd(n * k, l);
      mi = min(mi, t);
      ma = max(ma, t);
    }
  }
  cout << mi << " " << ma;
}
