#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
long long n, k, a, b;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
  ios::sync_with_stdio(false);
  while (cin >> n >> k >> a >> b) {
    long long ans1 = 0, ans2 = 1ll << 62;
    long long l1 = -b - a;
    long long l2 = b - a;
    long long l3 = -b + a;
    long long l4 = a + b;
    for (int i = 0; i <= n; i++) {
      if (l1 > 0) {
        ans1 = max(ans1, n * k / gcd(n * k, l1));
        ans2 = min(ans2, n * k / gcd(n * k, l1));
      }
      if (l2 > 0) {
        ans1 = max(ans1, n * k / gcd(n * k, l2));
        ans2 = min(ans2, n * k / gcd(n * k, l2));
      }
      if (l3 > 0) {
        ans1 = max(ans1, n * k / gcd(n * k, l3));
        ans2 = min(ans2, n * k / gcd(n * k, l3));
      }
      if (l4 > 0) {
        ans1 = max(ans1, n * k / gcd(n * k, l4));
        ans2 = min(ans2, n * k / gcd(n * k, l4));
      }
      l1 += k;
      l2 += k;
      l3 += k;
      l4 += k;
    }
    cout << ans2 << " " << ans1 << endl;
  }
  return 0;
}
