#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  long long int c = abs(a);
  long long int d = abs(b);
  while (d != 0) {
    long long int r = c % d;
    c = d;
    d = r;
  }
  return abs(c);
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  long long int n, k, a, b, tam;
  cin >> n >> k;
  cin >> a >> b;
  long long int s = 1 + a;
  tam = n * k;
  long long int curr = 1, mini = tam, maxi = 1;
  for (int i = 1; i <= n; i++) {
    long long int option = curr + b;
    if (option > tam) option -= tam;
    long long int diff = option - s;
    if (diff <= 0) diff += tam;
    long long int temp = gcd(tam, diff);
    temp = tam / temp;
    maxi = max(maxi, temp);
    mini = min(mini, temp);
    diff = s - option;
    if (diff <= 0) diff += tam;
    temp = gcd(tam, diff);
    temp = tam / temp;
    maxi = max(maxi, temp);
    mini = min(mini, temp);
    option = curr - b;
    if (option <= 0) option += tam;
    diff = option - s;
    if (diff <= 0) diff += tam;
    temp = gcd(tam, diff);
    temp = tam / temp;
    maxi = max(maxi, temp);
    mini = min(mini, temp);
    diff = s - option;
    if (diff <= 0) diff += tam;
    temp = gcd(tam, diff);
    temp = tam / temp;
    maxi = max(maxi, temp);
    mini = min(mini, temp);
    curr = curr + k;
  }
  cout << mini << " " << maxi << "\n";
  return 0;
}
