#include <bits/stdc++.h>
using namespace std;
const int N = 200 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
long long n, k, a, b;
bool read() {
  if (!(cin >> n >> k >> a >> b)) return false;
  return true;
}
long long gcd(long long a, long long b) {
  for (; a != 0; swap(a, b)) b %= a;
  return b;
}
long long sol1(long long a, long long b) {
  auto res = 1ll << 62;
  for (int i = 0; i <= n; ++i) {
    auto s1 = a;
    auto s2 = k * i + b;
    if (s1 < s2) res = min(res, n * k / gcd(n * k, s2 - s1));
  }
  return res;
}
long long sol2(long long a, long long b) {
  auto res = -1ll << 62;
  for (int i = 0; i <= n; ++i) {
    auto s1 = a;
    auto s2 = k * i + b;
    if (s1 < s2) res = max(res, n * k / gcd(n * k, s2 - s1));
  }
  return res;
}
void solve() {
  cout << min({sol1(-a, -b), sol1(-a, b), sol1(a, -b), sol1(a, b)}) << endl;
  cout << max({sol2(-a, -b), sol2(-a, b), sol2(a, -b), sol2(a, b)}) << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  while (read()) solve();
  return 0;
}
