#include <bits/stdc++.h>
using namespace std;
long long n, k, a, b;
long long mini = (long long)1e15;
long long maxi = 0;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
void calc(long long l) {
  if (l <= 0 || l > n * k) return;
  long long tmp = n * k / gcd(n * k, l);
  mini = min(tmp, mini);
  maxi = max(tmp, maxi);
}
int main() {
  cin >> n >> k >> a >> b;
  for (int i = -2; i <= n; ++i) {
    calc(k * i + b - a);
    calc(k * i - b - a);
    calc(k * i + b + a);
    calc(k * i - b + a);
  }
  cout << mini << " " << maxi << endl;
}
