#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const int N = 2e5 + 10;
const int M = 2e5 + 10;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const int mod2 = 998244353;
const int mod3 = 1e9 + 9;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
signed main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long n, k, a, b;
  cin >> n >> k >> a >> b;
  long long l, mn = INF, mx = 0;
  for (l = (a + b) % k; l <= n * k; l += k)
    if (l)
      mn = min(mn, n * k / gcd(l, n * k)), mx = max(mx, n * k / gcd(l, n * k));
  for (l = (a - b + k) % k; l <= n * k; l += k)
    if (l)
      mn = min(mn, n * k / gcd(l, n * k)), mx = max(mx, n * k / gcd(l, n * k));
  for (l = (-a + b + k) % k; l <= n * k; l += k)
    if (l)
      mn = min(mn, n * k / gcd(l, n * k)), mx = max(mx, n * k / gcd(l, n * k));
  for (l = (-a - b + k + k) % k; l <= n * k; l += k)
    if (l)
      mn = min(mn, n * k / gcd(l, n * k)), mx = max(mx, n * k / gcd(l, n * k));
  cout << mn << " " << mx << endl;
  return 0;
}
