#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  return (a % b == 0) ? b : gcd(b, a % b);
}
int main() {
  long long n, k;
  cin >> n >> k;
  long long length = n * k;
  long long gcdmax = 1;
  long long gcdmin = 10000000000;
  long long a, b;
  long long step;
  long long nowgcd = -1;
  cin >> a >> b;
  for (int i = 0; i <= n; i++) {
    step = k * i + a - b;
    if (step > 0) {
      nowgcd = gcd(step, length);
    }
    if (nowgcd > gcdmax) {
      gcdmax = nowgcd;
    }
    if (nowgcd < gcdmin && nowgcd != -1) {
      gcdmin = nowgcd;
    }
    step = k * i + a + b;
    if (step > 0) {
      nowgcd = gcd(step, length);
    }
    if (nowgcd > gcdmax) {
      gcdmax = nowgcd;
    }
    if (nowgcd < gcdmin && nowgcd != -1) {
      gcdmin = nowgcd;
    }
    step = k * i + b - a;
    if (step > 0) {
      nowgcd = gcd(step, length);
    }
    if (nowgcd > gcdmax) {
      gcdmax = nowgcd;
    }
    if (nowgcd < gcdmin && nowgcd != -1) {
      gcdmin = nowgcd;
    }
    step = k * i - a - b;
    if (step > 0) {
      nowgcd = gcd(step, length);
    }
    if (nowgcd > gcdmax) {
      gcdmax = nowgcd;
    }
    if (nowgcd < gcdmin && nowgcd != -1) {
      gcdmin = nowgcd;
    }
  }
  cout << length / gcdmax << " " << length / gcdmin << endl;
  return 0;
}
