#include <bits/stdc++.h>
using namespace std;
const long long bz = 4096;
long long area = 128 * 1024 * 4;
long long epoch = 1000000;
long long mn = 1e18, mx = -1;
long long n, k, i, j, a, b;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void judge(long long l) {
  if (l <= 0) return;
  long long g = gcd(n * k, l);
  long long ans = n * k / g;
  mx = max(mx, ans);
  mn = min(mn, ans);
}
int main() {
  scanf("%lld %lld %lld %lld", &n, &k, &a, &b);
  for (long long i = 0; i <= n; i++) {
    long long l;
    l = i * k + b - a;
    judge(l);
    l = i * k + b - (k - a);
    judge(l);
    l = (i + 1) * k - b - a;
    judge(l);
    l = (i + 1) * k - b - (k - a);
    judge(l);
  }
  cout << mn << " " << mx << endl;
}
