#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=5e3+5,M=N*N+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,X[N],Y[N];ll Po[M/2];vector<int> S[N];
int scc[N],CC;
void con(int x,int y){S[x].emplace_back(y);S[y].emplace_back(x);}
namespace Tarjan{
	int dfn[N],low[N],dh,st[N],sh;
	void Tarjan(int x,int La){
		dfn[x]=low[x]=++dh;st[++sh]=x;
		for(int i:S[x]) if(i^La) {
			if(dfn[i]) low[x]=min(low[x],dfn[i]);
			else Tarjan(i,x),low[x]=min(low[x],low[i]);
		}
		if(low[x]==dfn[x]){++CC;while(st[sh+1]^x) scc[st[sh]]=CC,sh--;}
	}
	void BD(){for(int i=1;i<=n;i++) if(!dfn[i]) Tarjan(i,0);}
}
int w[N],siz[N];ll dp[N][N],g[N];
void dfs(int x,int La){
	dp[x][siz[x]]=Po[siz[x]*(siz[x]-1)/2-w[x]];
	for(int i:S[x]) if(i^La){
		dfs(i,x);
		Mc(g,dp[x]);Me(dp[x],0);
		for(int j=1;j<=siz[x];j++){
			for(int h=0;h<=siz[i];h++) dp[x][j+h]=(dp[x][j+h]+g[j]*dp[i][h]%mod*Po[max(j*h-1,0)])%mod;
		}
		siz[x]+=siz[i];
	}
	for(int i=1;i<=siz[x];i++) dp[x][0]=(dp[x][0]+mod-dp[x][i])%mod;
	// for(int i=0;i<=siz[x];i++) cerr<<dp[x][i]<<' ';cerr<<'\n';
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	for(Po[0]=i=1;i<=n*(n-1)/2;i++) Po[i]=Po[i-1]*2%mod;
	for(i=1;i<=m;i++) scanf("%d%d",&X[i],&Y[i]),con(X[i],Y[i]);
	Tarjan::BD();
	for(i=1;i<=n;i++) S[i].clear();
	for(i=1;i<=n;i++) siz[scc[i]]++;
	for(i=1;i<=m;i++) if(scc[X[i]]==scc[Y[i]]) w[scc[X[i]]]++;else con(scc[X[i]],scc[Y[i]]);
	dfs(1,0);
	printf("%lld\n",(mod-dp[1][0])%mod);
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}