#include <bits/stdc++.h>
using namespace std;
long long int gcd1(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd1(b, a % b);
}
int main() {
  long long int n, k, a, b;
  cin >> n >> k;
  cin >> a >> b;
  long long int min_r, max_r;
  min_r = 9223372036854775807;
  max_r = 0;
  long long ss[2];
  ss[0] = a + 1;
  ss[1] = k + 1 - a;
  for (int j = 0; j < 2; j++) {
    long long s = ss[j];
    for (int i = 0; i <= n; i++) {
      long long int l = i * k + 1 - s + b;
      if (l <= 0) continue;
      long long int gcd = gcd1(n * k, l);
      long long ret = n * k / gcd;
      if (ret < min_r) min_r = ret;
      if (ret > max_r) max_r = ret;
    }
    for (int i = 0; i <= n; i++) {
      long long int l = i * k + 1 - s - b;
      if (l < 0) continue;
      long long int gcd = gcd1(n * k, l);
      long long ret = n * k / gcd;
      if (ret < min_r) min_r = ret;
      if (ret > max_r) max_r = ret;
    }
  }
  cout << min_r << " " << max_r << endl;
  return 0;
}
