#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long a, b;
long long check(long long len) { return (1ll * n * k / len); }
int gcd(int a, int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> a >> b;
  long long s = 1 + a;
  long long MOD = 1ll * n * k;
  long long first = 1e18 + 2, second = -1;
  for (long long i = 1; i <= 1ll * n * k; i += k) {
    long long c1 = (i + b + MOD) % MOD;
    long long c2 = (i - b + MOD) % MOD;
    if (c2 == 0) c2 = MOD;
    long long l = abs(s - c1);
    if (l == 0) l = MOD;
    if (MOD % l == 0) {
      first = min(first, check(l));
      second = max(second, check(l));
    } else {
      long long k = MOD / gcd(l, MOD);
      first = min(first, k);
      second = max(second, k);
    }
    l = abs(s - c2);
    if (l == 0) l = MOD;
    if (MOD % l == 0) {
      first = min(first, check(l));
      second = max(second, check(l));
    } else {
      long long k = MOD / gcd(l, MOD);
      first = min(first, k);
      second = max(second, k);
    }
  }
  cout << first << " " << second;
  return 0;
}
