#include <bits/stdc++.h>
using namespace std;
long long n, k, a, b;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  cin >> n >> k >> a >> b;
  long long num = n * k;
  long long ans1 = 1ll << 60, ans2 = 0;
  for (int i = 0; i < n; i++) {
    long long x1 = num / gcd(k - a - b + i * k, num);
    long long x2 = num / gcd(k - a + b + i * k, num);
    long long x3 = num / gcd(a + b + i * k, num);
    long long x4 = num / gcd(k + a - b + i * k, num);
    ans1 = min(ans1, min(x1, min(x2, min(x3, x4))));
    ans2 = max(ans2, max(x1, max(x2, max(x3, x4))));
  }
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
