#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,0,1,-1,1,1,-1,-1,0}; const ll dx[9]={1,-1,0,0,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll n,d,t;cin >> n >> d >> t; vl v(n);rep(i,n)cin >> v[i]; sort(all(v)); map> mp; rep(i,n){ mp[(v[i]+d*MOD)%d].push(v[i]); } ll ans=0; for(auto p:mp){ auto que=p.se; vl l,r; ll z=que.front();que.pop(); l.pb(z-d*t);r.pb(z+d*t); while(!que.empty()){ z=que.front();que.pop(); ll left=z-d*t,right=z+d*t; if(*r.rbegin()+d>=left){ r[r.size()-1]=right; } else{ l.pb(left);r.pb(right); } } //rep(i,l.size())cout << l[i] <<" " << r[i] <