#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 10);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
bool isPrime(long long N) {
  for (long long i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
long long cbrt(long long x) {
  long long lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
const long long nax = (long long)(1e5 + 10);
bool isPowerOfTwo(long long x) { return x && (!(x & (x - 1))); }
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  long long t = 1;
  while (t--) {
    long long n, k;
    cin >> n >> k;
    long long a, b;
    cin >> a >> b;
    long long mini = 1e18;
    long long maxi = 0;
    for (long long i = 1; i <= n; i++) {
      long long l1 = i * k + 1 + b;
      long long l2 = i * k + 1 - b;
      if (l1 > (n * k)) l1 -= n * k;
      if (l2 < 0) l2 += n * k;
      l1 -= (1 + a);
      l2 -= (1 + a);
      if (l1 < 0) l1 += (n * k);
      if (l2 < 0) l2 += (n * k);
      mini = min(mini, (n * k) / gcd(n * k, l1));
      maxi = max(maxi, (n * k) / gcd(n * k, l1));
      mini = min(mini, (n * k) / gcd(n * k, l2));
      maxi = max(maxi, (n * k) / gcd(n * k, l2));
    }
    cout << mini << " " << maxi;
  }
  return 0;
}
