#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  int n, k, a, b;
  cin >> n >> k >> a >> b;
  vector<int> divs;
  divs.push_back(0);
  for (int i = 1; i <= k; i++)
    if (k % i == 0) divs.push_back(i);
  long long mi = 1ll * n * k, ma = 0;
  for (int mk : divs) {
    for (int i = 0; i < n; i++) {
      for (int d0 : {-1, 1}) {
        for (int d1 : {-1, 1}) {
          long long l = d0 * a + d1 * b + 1ll * i * k + mk;
          if (l < 0) l *= -1;
          if ((l - d0 * a - d1 * b) % k) continue;
          long long g = gcd(1ll * n * k, l);
          long long t = 1ll * n * k / g;
          mi = min(mi, t);
          ma = max(ma, t);
        }
      }
    }
  }
  cout << mi << " " << ma << endl;
  return 0;
}
