#include <bits/stdc++.h>
using namespace std;
const int _ = 1e2;
const int maxn = 1e5 + _;
const int fbin = (1 << 17) + _;
const int mod = 998244353;
inline int ad(int x, int y) { return x >= mod - y ? x - mod + y : x + y; }
inline int re(int x, int y) { return x < y ? x - y + mod : x - y; }
inline int mu(int x, int y) { return (long long)x * y % mod; }
inline int qp(int x, long long y) {
  int r = 1;
  while (y) {
    if (y & 1) r = mu(r, x);
    x = mu(x, x);
    y >>= 1;
  }
  return r;
}
inline int iv(int x) { return qp(x, mod - 2); }
inline int dv(int x, int y) { return mu(x, qp(y, mod - 2)); }
inline long long gcd(long long x, long long y) { return x ? gcd(y % x, x) : y; }
long long mn, mx;
void solve(long long n, long long K, long long a, long long b) {
  for (int t = 0;; t++) {
    if (b - a + t * K > 0) {
      if (b - a + t * K > n) break;
      long long d = gcd(b - a + t * K, n);
      mn = min(mn, d);
      mx = max(mx, d);
    }
  }
}
int main() {
  long long n, K, a, b;
  scanf("%lld%lld%lld%lld", &n, &K, &a, &b);
  n *= K;
  mn = n, mx = 1;
  solve(n, K, a, b);
  solve(n, K, -a, b);
  solve(n, K, a, -b);
  solve(n, K, -a, -b);
  printf("%lld %lld\n", n / mx, n / mn);
  return 0;
}
