// clang-format off
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define st first
#define nd second
#define bit(s,x) (((s)>>(x))&1)
#define ctz(s) __builtin_popcount(s)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull; 
//typedef __int128 i128; 
typedef long double ld;
typedef pair<int,int> pii; typedef pair<ll,int> pli; typedef pair<ll,ll> pll; typedef pair<int,ll> pil;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
inline void write(ll x){ if(x<0) putchar('-'),x=-x; if(x>9) write(x/10); putchar(x%10+'0'); }
// remember to change!!!
const int mod=998244353;
inline void plust(int &x,int y,int p=mod){x=x+y<p?x+y:x+y-p;}
inline void mul(int &x,int y,int p=mod){x=1ll*x*y%p;}
inline int fp(int x,ll p=mod-2,int m=mod,int res=1){
	for(;p;p>>=1){if(p&1)mul(res,x,m);mul(x,x,m);}
	return res;
}
const int N=5e3+3;
const int INF=0x3fffffff;
// clang-format on
int n,m;
vector<int>G[N],G2[N];
stack<int>stk;
int dfn[N],low[N],col[N],tim,dcc;
inline void dfs(int u,int fa){
	dfn[u]=low[u]=++tim;stk.push(u);
	for(auto v:G[u])if(v!=fa){
		if(!dfn[v]){
			dfs(v,u),low[u]=min(low[u],low[v]);
			if(low[v] == dfn[v]){
				++dcc;
				for(;stk.top()!=v;stk.pop())col[stk.top()]=dcc;
				stk.pop();col[v]=dcc;
			}
		}
		else low[u] = min(low[u],dfn[v]);
	}
}
int siz[N],eg[N],dp[N][N];
int p2[N*N];
inline void dfs2(int u,int fa){
	dp[u][siz[u]]=1;
	for(auto v:G2[u])if(v!=fa){
		dfs2(v,u);
		int s=0;
		vector<int>tmp(siz[u]+siz[v]+1);
		for(int i=1;i<=siz[v];++i)plust(s,dp[v][i]);
		for(int i=1;i<=siz[u];++i)tmp[i] = 1ll*dp[u][i]*(mod-s)%mod;
		for(int i=1;i<=siz[u];++i)for(int j=1;j<=siz[v];++j)plust(tmp[i+j],1ll*dp[u][i]*dp[v][j]%mod*p2[i*j-1]%mod);
		siz[u] += siz[v];
		for(int i=1;i<=siz[u];++i)dp[u][i] = tmp[i];
	}
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	p2[0]=1;
	for(int i=1;i<N*N;++i)p2[i] = 1ll*p2[i-1]*2%mod;
	n=read(),m=read();
	for(int i=1;i<=m;++i){
		int u=read(),v=read();
		G[u].pb(v),G[v].pb(u);
	}
	dfs(1,0);
	++dcc;for(;!stk.empty();stk.pop())col[stk.top()]=dcc;
	for(int i=1;i<=n;++i) ++siz[col[i]];
	for(int i=1;i<=n;++i) for(auto j:G[i])if(i<j){
		if(col[i] == col[j]){++eg[col[i]];continue;}
		G2[col[i]].pb(col[j]), G2[col[j]].pb(col[i]);
	}
	int t=1;
	for(int i=1;i<=dcc;++i)mul(t,p2[siz[i]*(siz[i]-1)/2 - eg[i]]);
	dfs2(1,0);
	int ans=0;
	for(int i=1;i<=n;++i)plust(ans,dp[1][i]);
	cout<<1ll*ans*t%mod<<"\n";
    return 0;
}