#include <bits/stdc++.h>

using namespace std;
const int N = 100010;

int n, m, t, ans;
priority_queue<int, vector<int>, greater<int> > q;

int main() {
	cin >> n >> m >> t;
	for (int i = 1; i <= m; i++) {
		int x;
		cin >> x;
		q.push(x);
	}
	for (int i = 1; i <= n; i++) {
		int a = q.top();
		q.pop();
		q.push(a + t);
	}
	while (!q.empty()) {
		ans = max(ans, q.top());
		q.pop();
	}
	cout << ans << endl;
	return 0;
}