#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); }
int main() {
  long long n, k, a, b;
  cin >> n >> k >> a >> b;
  long long ans1 = n * k + 1, ans2 = 0;
  for (int f = 0; f < 2; f++)
    for (int g = 0; g < 2; g++) {
      long long x = a, y = b;
      if (f == 1) x = (k - a) % k;
      if (g == 1) y = (k - b) % k;
      x -= y;
      if (x < 0) x += k;
      for (int i = 0; i < n; i++) {
        y = x + i * k;
        y = gcd(y, n * k);
        y = (n * k) / y;
        ans1 = min(ans1, y);
        ans2 = max(ans2, y);
      }
    }
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
