#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b)
    return gcd(b, a % b);
  else
    return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  long long n, k, a, b;
  cin >> n >> k >> a >> b;
  long long p = k + 1 - a;
  long long mn = 1e18, mx = 0;
  for (int i = 1; i <= n; ++i) {
    long long q = k * i + 1 - b;
    if (q > p) {
      long long l = n * k / gcd(q - p, n * k);
      mn = min(mn, l);
      mx = max(mx, l);
    }
    q = k * i + 1 + b;
    if (q % (n * k) >= p) {
      long long l = n * k / gcd(q - p, n * k);
      mn = min(mn, l);
      mx = max(mx, l);
    }
  }
  p = 1 + a;
  for (int i = 1; i <= n; ++i) {
    long long q = k * i + 1 - b;
    if (q > p) {
      long long l = n * k / gcd(q - p, n * k);
      mn = min(mn, l);
      mx = max(mx, l);
    }
    q = k * i + 1 + b;
    if (q % (n * k) >= p) {
      long long l = n * k / gcd(q - p, n * k);
      mn = min(mn, l);
      mx = max(mx, l);
    }
  }
  cout << mn << " " << mx << endl;
}
