#include<bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long f[1000006], n, m, l;
bool b[1000006];
vector<long long> v;
void calc() {
	f[n] += f[1];
	for (int i = 1, k = 0; i <= n; i++) {
		if (i > l && b[i - l]) {
			f[i] += f[i - l];
			f[i] %= mod;
		}
		if (i < n) {
			f[i + 1] += f[i];
			f[i + 1] %= mod;
		}
		while (k < m && i - v[k] >= l) k++;
		if (b[i]) {
			for (int j = k; j < m && v[j] < i; j++) {
				long long op = v[j];
				f[i] += f[op];
				f[i] %= mod;
				f[op] = f[i];
			}
		}
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> l;
	long long p;
	for (int i = 1; i <= m; i++) {
		cin >> p;
		b[p] = true;
		v.push_back(p);
	}
	long long ans1, ans2, ans3, ans4, ans;
	sort(v.begin(), v.end());
	f[1] = 1;
	calc();
	ans1 = f[n];
	ans3 = f[n - 1];
	memset(f, 0, sizeof(f));
	f[2] = 1;
	calc();
	ans2 = f[n - 1];
	ans4 = f[n];
	ans4 *= ans3;
	ans4 %= mod;
	ans2 *= ans1;
	ans2 %= mod;
	ans = ans2 - ans4;
	if (ans < 0) ans += mod;
	cout << ans;
	return 0;
}