#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
int n,m,t;
priority_queue<int,vector<int>,greater<int>> q;
int main() {
    cin>>n>>m>>t;
    int u;
    for(int i=1;i<=m;i++){
        cin>>u;
        q.push(u);
    }
    for(int i=1;i<=n;i++){
        int t1=q.top();
        q.pop();
        q.push(t1+t);
    }
    while(q.size()!=1)q.pop();
    cout<<q.top();
    return 0;
}