#include <bits/stdc++.h>
using namespace std;
long long n, k, a, b, ls, nk, minans, maxans;
long long s[2], t[2];
long long gcd(long long x, long long y) {
  if (x < y) return gcd(y, x);
  if (y == 0) return x;
  return gcd(y, x % y);
}
int main() {
  cin >> n >> k >> a >> b;
  nk = n * k;
  s[0] = 1ll + a;
  s[1] = k + 1ll - a;
  if (a == 0) s[1] = s[0];
  t[0] = 1ll + b;
  t[1] = k + 1ll - b;
  if (b == 0) t[1] = t[0];
  maxans = -1ll;
  minans = n * k + 1ll;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 2; j++)
      for (int z = 0; z < 2; z++) {
        ls = t[z] + i * k - s[j];
        ls = (ls + nk) % (nk);
        minans = min(minans, nk / gcd(nk, ls));
        maxans = max(maxans, nk / gcd(nk, ls));
      }
  }
  cout << minans << " " << maxans << endl;
  return 0;
}
