#include <bits/stdc++.h>
#define mod 998244353
using namespace std;

const int N = 5005;
using ll = long long ;

struct Edge {
	int to, nxt;
}edge[N << 1];

int n, m, _u[N], _v[N], head[N], cnt = 1;
int low[N], dfn[N], tim;
stack<int> st;
int bl[N], num[N], tot;
int two[N * N], siz[N], f[N][N], g[N];

void conn(int u, int v) {
	edge[++cnt] = {v, head[u]};
	head[u] = cnt;
}

void tarjan(int u, int inEg) {
	low[u] = dfn[u] = ++tim;
	st.push(u);
	for (int i = head[u]; i; i = edge[i].nxt) {
		int v = edge[i].to;
		if (!dfn[v]) {
			tarjan(v, i);
			low[u] = min(low[u], low[v]);
		} else if (i != (inEg ^ 1))
			low[u] = min(low[u], dfn[v]);
	}
	if (low[u] == dfn[u]) {
		++tot;
		while (true) {
			int t = st.top(); st.pop();
			bl[t] = tot;
			siz[tot]++;
			if (t == u) break ;
		}
	}
}

void dfs(int u, int rt) {
	f[u][siz[u]] = two[siz[u] * (siz[u] - 1) / 2 - num[u]];
	for (int i = head[u]; i; i = edge[i].nxt) {
		int v = edge[i].to;
		if (v == rt) continue ;
		dfs(v, u);
		for (int i = 0; i <= siz[u]; i++) g[i] = f[u][i], f[u][i] = 0;
		for (int i = 0; i <= siz[u]; i++) {
			for (int j = 0; j <= siz[v]; j++) {
				(f[u][i + j] += (ll)g[i] * f[v][j] % mod * two[i * j - 1] % mod) %= mod;
				(f[u][i] += mod - (ll)g[i] * f[v][j] % mod) %= mod;
			}
		}
		siz[u] += siz[v];
	}
}

void solve() {
	cin >> n >> m;
	
	two[0] = 1;
	for (int i = 1; i <= n * n; i++) two[i] = two[i - 1] * 2 % mod;
	
	for (int i = 1; i <= m; i++) {
		cin >> _u[i] >> _v[i];
		conn(_u[i], _v[i]);
		conn(_v[i], _u[i]);
	}
	
	tarjan(1, 0);
	
	cnt = 0;
	memset(head, 0, sizeof head);
	for (int i = 1; i <= m; i++) {
		if (bl[_u[i]] == bl[_v[i]]) num[bl[_u[i]]]++;
		else {
			conn(bl[_u[i]], bl[_v[i]]);
			conn(bl[_v[i]], bl[_u[i]]);
		}
	}
	
	int ans = 0;
	dfs(1, 0);
	for (int i = 0; i <= n; i++) {
		ans += f[1][i];
		if (ans >= mod) ans -= mod;
	}
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}