#include <iostream>
#include <cmath>
#include <vector>
#include <map>
using namespace std;

const int maxn = 1e6 + 13;

int e[20];
bool dp[maxn];
int dp2[maxn];
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		int u, v;
		cin >> u >> v;
		--u; --v;
		e[u] |= 1 << v;
		e[v] |= 1 << u;
	}

	dp[0] = 1;
	for (int mask = 1; mask < (1 << n); ++mask) {
		for (int i = 0; i < n; ++i) {
			if (mask >> i & 1)
				if(((mask & ~(1 << i)) & e[i]) == (mask & ~(1 << i)))
					dp[mask] |= dp[mask & ~(1 << i)];
 		}
	}
	for (int mask = 1; mask < (1 << n); ++mask) {
		if (dp[mask]) {
			dp2[mask] = 1;
			continue;
		}
		int cnt = 0;
		for (int i = 0; i < n; ++i)cnt += mask >> i & 1;
		dp2[mask] = cnt;
		for (int s = mask; s; s = (s - 1) & mask) {
			dp2[mask] = min(dp2[mask], dp2[s] + dp2[~s & mask]);
 		}
	}
	cout << dp2[(1 << n) - 1] << "\n";
	return 0;
}
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=998244353;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

#define MAX_N 1000010
ll inv[MAX_N+10],fac[MAX_N+10],ifac[MAX_N+10];

void setComb(){
  inv[0]=1;inv[1]=1;fac[1]=1;ifac[1]=1;fac[0]=1;ifac[0]=1;
  for(int i=2;i<MAX_N;i++){
    inv[i]=(-MOD/i)*inv[MOD%i]%MOD;
    fac[i]=fac[i-1]*i%MOD;
    ifac[i]=ifac[i-1]*inv[i]%MOD;

    inv[i]=(inv[i]+MOD)%MOD;
    fac[i]=(fac[i]+MOD)%MOD;
    ifac[i]=(ifac[i]+MOD)%MOD;
  }
  return;
}

ll comb(ll n,ll k){
  if(n<k||n<0||k<0) return 0;
  else return ((fac[n]*ifac[k]%MOD*ifac[n-k]%MOD+MOD)%MOD);
}

ll hcomb(ll n,ll r){// this size is really ok??
  if(n==0&&r==0) return 1;
  else if(n<0||r<0) return 0;
  else return comb(n+r-1,r);
}

ll binom(ll n,ll k){
  if(n<k||n<0||k<0) return 0;
  ll res=1;
  for(ll i=0;i<k;i++) res=res*(n-i)%MOD;
  res=res*ifac[k]%MOD;
  return res;
}

ll mod_pow(ll x,ll n){
  x%=MOD;
  ll res=1;
  while(n>0){
    if(n&1) res=res*x%MOD;
    x=x*x%MOD;
    n>>=1;
  }
  return res;
}

ll mod_inverse(ll x){
  return mod_pow(x,MOD-2);
}

void add(ll &a,ll b){
  a=(a+b)%MOD;
}

void mul(ll &a,ll b){
  a%=MOD;b%=MOD;
  a=a*b%MOD;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  setComb();

  ll N,K;
  cin>>N>>K;
  vector<ll> A(N);
  rep(i,N) cin>>A[i];

  vector<ll> sum(K+1,0);
  vector<ll> num(N,1);
  for(int k=1;k<=K;k++){
    rep(i,N){
      mul(num[i],A[i]);
      add(sum[k],num[i]);
    }
  }

  vector<ll> dp(K+1,0);
  for(int k=1;k<=K;k++){
    add(dp[k],(N)*sum[k]%MOD);
    add(dp[k],(N)*sum[k]%MOD);

    for(int x=1;x<k;x++){
      ll res=sum[x];
      mul(res,sum[k-x]);
      mul(res,comb(k,x));
      add(dp[k],res);
    }
  }

  vector<ll> ans=dp;
  rep(i,N) num[i]=1;
  for(int k=1;k<=K;k++){
    rep(i,N){
      mul(num[i],(A[i]+A[i])%MOD);
      add(ans[k],MOD-num[i]);
    }
    mul(ans[k],inv[2]);
  }

  rep(i,K) cout<<ans[i+1]<<"\n";

  return 0;
}
