#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=200+5,M=N*4,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const ll INF=1e15+7;mt19937 rnd(263082);
int n,k,s,A[N];ll dp[N][N],C[N][N];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
void Solve(){
	int i,j,h;scanf("%d%d%d",&n,&k,&s);ll inv=mpow(n);
	for(i=1;i<=k;i++) scanf("%d",&A[i]),A[i]=(A[i]-s+n)%n,A[i]=(n-A[i])%n;
	for(i=0;i<=k;i++) for(C[i][0]=j=1;j<=i;j++) C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
	sort(A+1,A+k+1);A[k+1]=n;
	dp[0][0]=1;
	for(i=1;i<=k;i++){
		for(j=0;j<i;j++){
			ll w=1,pw=(A[i+1]-A[i])*inv%mod;
			for(h=0;h<=j;h++) {
				dp[i][j]+=dp[i-1][j-h]*w%mod*C[j][h]%mod;
				w=w*pw%mod;
			}
			dp[i][j]%=mod;
		}
	}
	ll ans=0;for(i=0;i<=k;i++) ans+=dp[k][i];printf("%lld\n",ans%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}