#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
long long M1 = 1000000007;
long long M2 = 67280421310721;
long long M3 = 998244353;
long long INF = 1e18;
long long power(long long a, long long b, long long mod) {
  long long ans = 1;
  long long prod = a;
  while (b) {
    if (b % 2) ans = (ans * prod) % mod;
    prod = (prod * prod) % mod;
    b /= 2;
  }
  return ans;
}
long long inv(long long a, long long mod) { return power(a, mod - 2, mod); }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long fact(long long n, long long mod) {
  long long f = 1;
  for (long long i = 1; i <= n; i++) f = (f * i) % mod;
  return f;
}
long long ncr(long long n, long long r, long long mod) {
  if (mod == 1) {
    return (fact(n, mod) / fact(r, mod)) / fact(n - r, mod);
  }
  return (((fact(n, mod) * inv(fact(r, mod), mod)) % mod) *
          inv(fact(n - r, mod), mod)) %
         mod;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  long long a, b;
  cin >> a >> b;
  long long tot = n * k;
  long long st = a;
  set<long long> en;
  long long i;
  for (i = 0; i < n * k; i = i + k) {
    long long x, y;
    x = i - b;
    y = i + b;
    x = x % tot;
    y = y % tot;
    if (x < 0) x += tot;
    if (y < 0) y += tot;
    en.insert(x);
    en.insert(y);
  }
  long long mx = 0;
  long long mn = INF;
  for (auto u = en.begin(); u != en.end(); u++) {
    long long x = *u;
    long long d = x - st;
    if (d <= 0) d += tot;
    long long hcf = gcd(d, tot);
    long long v = tot / hcf + 1;
    mx = max(mx, v);
    mn = min(mn, v);
  }
  cout << mn - 1 << " " << mx - 1;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout << fixed << setprecision(10);
  auto start = high_resolution_clock::now();
  long long i, t = 1;
  for (i = 1; i <= t; i++) solve();
  auto stop = high_resolution_clock::now();
  auto duration = duration_cast<microseconds>(stop - start);
}
