#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define mem(a,b) memset(a,b,sizeof(a))
#define mpy(a,b) memcpy(a,b,sizeof(b))
#define dbg(...) cerr<<"#"<<__LINE__<<": "<<__VA_ARGS__<<endl
#define Fi(s) freopen(s,"r",stdin)
#define Fo(s) freopen(s,"w",stdout)
#define Fio(s) Fi(s".in"),Fo(s".out")
#define SZ(S) (int)S.size()
#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}

/*template <class T,class U>
inline void add(T &x,U y){
	x += y;
	if(x >= mod) x -= mod;
}

template <class T,class U>
inline void sub(T &x,U y){
	x -= y;
	if(x < 0) x += mod;
}*/

ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}
int m,n,s;
int q[205],a[205],b[205];
ll sum[205][205],C[205][205],fact[205],ifac[205];

ll dp[205][205],res[205][205];

int main(){
	scanf("%d%d%d",&m,&n,&s);
	int pos = -1;
	rep(i,1,n){
		scanf("%d",&q[i]);
		if(q[i] == s) pos = i;
		a[i] = q[i] - q[i - 1];
	}
	a[1] += m - q[n];
	assert(pos != -1);
	rep(i,pos + 1,n) b[i - pos] = a[i];
	rep(i,1,pos) b[i + n - pos] = a[i];

	rep(i,1,n){
		rep(j,i,n){
			sum[i][j] = (sum[i][j - 1] + b[j]) % mod;
		}
	}
//	rep(i,1,n) printf("%d ",b[i]);
//	printf("\n");
	ll in = power(m);
	rep(i,1,n){
		rep(j,i,n){
			sum[i][j] = sum[i][j] * in % mod;
		}
	}

	rep(i,0,n){
		C[i][0] = 1;
		rep(j,1,i) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
	}
	fact[0] = 1;
	rep(i,1,n) fact[i] = fact[i - 1] * i % mod;
	ifac[n] = power(fact[n]);
	per(i,n - 1,0) ifac[i] = ifac[i + 1] * (i + 1) % mod;

	rep(i,1,n) dp[i][i] = 1;
	rep(len,2,n){
		rep(i,1,n){
			int j = i + len - 1;
			if(j > n) break;
			rep(k,i,j - 1) dp[i][j] += sum[i][k] * dp[i][k] % mod * dp[k + 1][j] % mod * C[j - i - 1][k - i] % mod;
			dp[i][j] %= mod;
		}
	}

	rep(i,1,n){
		rep(j,i,n){
//			printf("range [%d,%d] %lld\n",i,j,dp[i][j]);
			dp[i][j] = dp[i][j] * ifac[j - i] % mod;
		}
	}
	res[0][0] = 1;
	rep(i,1,n){
		rep(j,1,i){
			rep(k,0,j - 1){
				res[i][k + i - j] += res[j - 1][k] * dp[j][i] % mod;
			}
		}
	}
	ll ans = 0;
	rep(i,0,n) ans += res[n][i] * fact[i] % mod;
	printf("%lld\n",ans % mod);
	return 0;
}