#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

vector<mint> poly_inv(vector<mint> &a, int M){
	if (M <= 0) return {};
	int n = a.size();
	mint r = a[0].inv();
	vector<mint> res = {r};
	for (int m = 1; m < M; m <<= 1){
		vector<mint> f = a;
		f.resize(2 * m);
		vector<mint> g = res;
		g.resize(2 * m);
		internal::butterfly(f);
		internal::butterfly(g);
		for (int i=0; i<2*m; i++){
			f[i] = f[i] * g[i];
		}
		internal::butterfly_inv(f);
		for (int i=0; i<m; i++){
			f[i] = f[i + m];
		}
		for (int i=0; i<m; i++){
			f[i + m] = 0;
		}
		internal::butterfly(f);
		for (int i=0; i<2*m; i++){
			f[i] = f[i] * g[i];
		}
		internal::butterfly_inv(f);
		mint iz = mint(2*m).inv();
		iz = - iz * iz;
		for (int i=0; i<m; i++){
			f[i] = f[i] * iz;
		}
		res.insert(res.end(), f.begin(), f.begin()+m);
	}
	res.resize(M);
	return res;
}

vector<mint> multi_eval(vector<mint> x, vector<mint> a){
	int n = x.size();
	int siz = 1 << internal::ceil_pow2(n);
	vector<vector<mint>> g(2*siz, vector<mint>{1});
	for (int i=0; i<n; i++) g[i + siz] = {-x[i], 1};
	for (int i=siz-1; i>0; i--) g[i] = convolution(g[2*i], g[2*i+1]);
	vector<mint> f;
	for (int i=1; i<2*siz; i++){
		if (i==1) f = a;
		else f = g[i>>1];
		int fs = f.size(), gs = g[i].size();
		int m = fs - gs + 1;
		vector<mint> v = {}, w = {};
		if (m > 0){
			vector<mint> ft(m);
			for (int j=0; j<m; j++) ft[j] = f[fs-1-j];
			vector<mint> gt(gs);
			for (int j=0; j<gs; j++) gt[j] = g[i][gs-1-j];
			v = convolution(ft, poly_inv(gt, m));
			v.resize(m);
			reverse(v.begin(), v.end());
			w = convolution(v, g[i]);
		}
		g[i] = f;
		for (int j=0; j<w.size(); j++){
			g[i][j] -= w[j];
		}
		while (g[i].size() > 1 && g[i][g[i].size() - 1] == 0){
			g[i].pop_back();
		}
	}
	vector<mint> ret(n);
	for (int i=0; i<n; i++){
		ret[i] = g[i+siz][0];
	}
	return ret;
}

//defmodfact
const int COMinitMAX = 300000;
mint fact[COMinitMAX+1], factinv[COMinitMAX+1];

void modfact(){
	fact[0] = 1;
	for (int i=1; i<=COMinitMAX; i++){
		fact[i] = fact[i-1] * i;
	}
	factinv[COMinitMAX] = fact[COMinitMAX].inv();
	for (int i=COMinitMAX-1; i>=0; i--){
		factinv[i] = factinv[i+1] * (i+1);
	}
}

mint cmb(int a, int b){
	if (a<b || b<0) return mint(0);
	return fact[a]*factinv[b]*factinv[a-b];
}
//--------


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	modfact();

	int m, n; cin >> m >> n;
	vector<int> c(m);
	for (int i=0; i<n; i++){
		int x; cin >> x;
		c[x-1]++;
	}
	deque<vector<mint>> dq;
	int r = 0;
	for (int i=0; i<m; i++){
		for (int j=0; j<c[i]; j++){
			dq.push_back({-j, 1});
		}
		r = max(r, c[i]);
	}

	while (dq.size() > 1){
		vector<mint> f1 = dq.front(); dq.pop_front();
		vector<mint> f2 = dq.front(); dq.pop_front();
		dq.push_back(convolution(f1, f2));
	}

	vector<mint> h1 = dq.front();
	vector<mint> h2(n+1);
	for (int i=0; i<n+1; i++){
		h2[i] = i;
	}
	vector<mint> d = multi_eval(h2, h1);

	vector<mint> f(n+1);
	for (int i=0; i<n+1; i++){
		f[i] = d[i] * factinv[i];
	}

	vector<mint> g(n+1);
	mint typ = 1;
	for (int i=0; i<n+1; i++){
		g[i] = typ * factinv[i];
		typ *= -1;
	}

	vector<mint> fg = convolution(f, g);
	mint ans = 0;
	for (int i=0; i<n+1; i++){
		ans += fact[i] * fg[i];
	}
	cout << ans.val() << endl;
}