#include <bits/stdc++.h>
using namespace std;
const long long INF = 1E18;
long long abs1(long long x) { return x < 0 ? -x : x; }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long tot, x, y;
void calc(long long l) {
  long long t = tot / gcd(tot, l);
  x = min(x, t), y = max(y, t);
}
int main() {
  int n, k, a, b;
  scanf("%d%d%d%d", &n, &k, &a, &b);
  tot = 1ll * n * k;
  x = INF;
  y = 0;
  for (int i = 0; i < n; i++) {
    calc(abs1(1ll * i * k + b - a));
    calc(abs1(1ll * (i + 1) * k - b - a));
    calc(abs1(1ll * i * k + b - (k - a)));
    calc(abs1(1ll * (i + 1) * k - b - (k - a)));
  }
  printf("%lld %lld\n", x, y);
  return 0;
}
