#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1e5 + 10;

int n, m, t;
int a[N];

int main()
{
	scanf("%d%d%d", &m, &n, &t);
	for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
	for (int i = 1; i <= m; i ++ )
	{
		int idx = 0, num = 1e9;
		for (int i = 1; i <= n; i ++ )
		{
			if (num > a[i])
			{
				num = a[i];
				idx = i;
			}
		}
		a[idx] += t;
	}
	int ans = 0;
	for (int i = 1; i <= n; i ++ )
	{
		ans = max(ans, a[i]);
	}
	printf("%d\n", ans);
	return 0;
}