#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
const ll mod = 1000000007;
const ll INF = 1000000099;
const ll LINF = (ll)(1e18 + 99);
const vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T, typename U>
inline bool chmin(T& t, const U& u) {
  if (t > u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T, typename U>
inline bool chmax(T& t, const U& u) {
  if (t < u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
inline T mpow(T a, T n) {
  T res = 1;
  for (; n; n >>= 1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll s, f, t;
  cin >> s >> f >> t;
  ll n, ans, mn = LINF;
  cin >> n;
  V<ll> v(n);
  for (ll i = 0; i < (ll)(n); ++i) cin >> v[i];
  v.push_back(f - t + 1);
  sort((v).begin(), (v).end());
  ll wait = max(0ll, s - v[0] + 1);
  mn = max(0ll, s - v[0] + 1);
  ans = v[0] - 1;
  if (ans >= f) {
    ans = s;
    return 0;
  }
  wait += t;
  for (ll i = 1; i < (ll)(n + 1); ++i) {
    wait = max({0ll, wait - (v[i] - v[i - 1])});
    if (v[i] - 1 + wait <= f - t && chmin(mn, wait)) ans = v[i] - 1;
    wait += t;
  }
  cout << ans << '\n';
}
