#include <bits/stdc++.h>
using namespace std;
void setIO(const string &name = "") {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  if (name.length()) {
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
  }
}
template <typename T>
void read(vector<T> &a) {
  for (auto &x : a) cin >> x;
}
template <typename T>
void read(vector<T> &a, int n) {
  a.resize(n);
  for (auto &x : a) cin >> x;
}
template <class T, class U>
ostream &operator<<(ostream &out, const pair<T, U> &v) {
  out << "(";
  out << v.first << "," << v.second;
  return out << ")";
}
template <class T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << "[";
  for (auto(i) = 0; (i) < ((int)(v).size()); (i)++) {
    if (i) out << ", ";
    out << v[i];
  }
  return out << "]";
}
template <typename T>
void print(vector<T> &a) {
  for (const auto &x : a) cout << x << ' ';
  cout << '\n';
}
void MOD(int &x, int m = 1000000007) {
  x %= m;
  if (x < 0) x += m;
}
template <typename T>
void dbg(const char *name, T &&arg1) {
  cout << name << " : " << arg1 << '\n';
}
template <typename T, typename... U>
void dbg(const char *names, T &&arg1, U &&...args) {
  const char *comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  dbg(comma + 1, args...);
}
template <class T>
void read(T &x) {
  cin >> x;
}
template <class T, class... U>
void read(T &t, U &...u) {
  read(t);
  read(u...);
}
int gcd(int a, int b) { return !a ? b : gcd(b % a, a); }
int n, k, mx;
vector<int> a;
int cnt[int(1e6 + 10)];
int range(int l, int r) {
  r = min(r, int(1e6 + 10) - 1);
  return cnt[r] - cnt[l - 1];
}
bool ok(int d) {
  int tot = 0;
  for (int p = 1; p <= (mx + d - 1) / d; p++) {
    if (p * d >= int(1e6 + 10)) continue;
    tot += range(p * d, p * d + k);
  }
  assert(tot <= n);
  return tot == n;
}
int32_t main() {
  setIO();
  read(n, k);
  read(a, n);
  for (auto &(c) : (a)) cnt[c]++;
  for (auto(i) = 1; (i) < (int(1e6 + 10)); (i)++) cnt[i] += cnt[i - 1];
  int mn = *min_element((a).begin(), (a).end());
  mx = *max_element((a).begin(), (a).end());
  if (mn <= k + 1) {
    cout << mn << '\n';
    return 0;
  }
  int ans = k + 1;
  for (auto(i) = k + 2; (i) < (mn + 1); (i)++) {
    if (ok(i)) {
      ans = i;
    }
  }
  cout << ans << '\n';
  return 0;
}
