#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
ll n, k, a, b;
ll gcd(ll x, ll y) { return y == 0 ? x : gcd(y, x % y); }
ll d_nearest(ll x) { return min(x % k, k - (x % k)); }
int main() {
  ios_base::sync_with_stdio(false);
  cout << setprecision(12);
  cin.tie(nullptr);
  cin >> n >> k >> a >> b;
  ll x = LLONG_MAX;
  ll y = LLONG_MIN;
  for (ll s : {a, k - a}) {
    ll l1 = 1;
    while (d_nearest(s + l1) != b) l1++;
    ll l2 = l1 + 1;
    while (d_nearest(s + l2) != b) l2++;
    for (int i = 0; i < int(n); i++) {
      x = min(x, n * k / gcd(l1 + i * k, n * k));
      y = max(y, n * k / gcd(l1 + i * k, n * k));
    }
    for (int i = 0; i < int(n); i++) {
      x = min(x, n * k / gcd(l2 + i * k, n * k));
      y = max(y, n * k / gcd(l2 + i * k, n * k));
    }
  }
  cout << x << " " << y << endl;
}
