#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / GCD(a, b); }
const long long N = 1e5 + 7;
const long long inf = 1e18 + 1;
const long long mod = 1e9 + 7;
const double eps = 1e-8;
long long n, k, a, b;
void calc(long long& maxn, long long& minn, long long len) {
  len %= k;
  if (len < 0) len += k;
  len %= k;
  for (len != 0 ? len : len = k; len <= n * k; len += k) {
    long long tmp = n * k / GCD(n * k, len);
    maxn = max(maxn, tmp);
    minn = min(minn, tmp);
  }
}
int main() {
  cin >> n >> k;
  cin >> a >> b;
  long long maxn = 0, minn = inf;
  calc(maxn, minn, a + b);
  calc(maxn, minn, -1 * (a + b));
  calc(maxn, minn, a - b);
  calc(maxn, minn, b - a);
  cout << minn << " " << maxn << "\n";
  return 0;
}
