#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long linf = (long long)1e18;
struct th {
  int first, second, third;
};
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
bool cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << setprecision(20);
  long long n, k, a, b;
  cin >> n >> k >> a >> b;
  long long cur[] = {a + b - k, a - b};
  long long x = n * k, y = 0;
  if (cur[0] == -k) cur[0] = 0;
  for (int i = 0; i <= n; i++) {
    cur[0] += k;
    cur[1] += k;
    long long temp[] = {k * n / gcd(cur[0], k * n), k * n / gcd(cur[1], k * n)};
    x = min(x, temp[0]);
    x = min(x, temp[1]);
    y = max(y, temp[0]);
    y = max(y, temp[1]);
  }
  cout << x << ' ' << y;
  return 0;
}
