#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=9998244353,i2=mod+1>>1;
struct qpow{
    ll pp1[5010],pp2[5010];
    qpow(ll p){
        pp1[0]=1;for(int i=1;i<=5000;i++)pp1[i]=pp1[i-1]*p%mod;
        p=pp1[5000];
        pp2[0]=1;for(int i=1;i<=5000;i++)pp2[i]=pp2[i-1]*p%mod;
    }ll operator()(ll t){return pp1[t%5000]*pp2[t/5000]%mod;}
}p2(2);
ll dp[5010][5010];
int n,m,dfn[5010],low[5010],stk[5010],bl[5010],sz[5010],vc[5010],ec[5010],tp,tot,edcc=0;
set<int>G[5010],adj[5010];
void tarjan(int u,int fa){
    dfn[u]=low[u]=++tot;
    stk[++tp]=u;
    for(int v:G[u])
    if(!dfn[v])tarjan(v,u),low[u]=min(low[u],low[v]);
    else if(v!=fa)low[u]=min(low[u],dfn[v]);
    if(dfn[u]==low[u]){
        edcc++;int v;
        do{
            v=stk[tp--],vc[edcc]++,bl[v]=edcc;
            for(int x:G[v])if(bl[x])
            if(bl[x]!=edcc)adj[edcc].insert(bl[x]);
            else ec[edcc]++;
        }while(v!=u);
    }
}
void solve(int u){
    static int t[5010];
    dp[u][0]=p2(vc[u]*1ll*(vc[u]-1)/2-ec[u]);
    for(int v:adj[u]){
        solve(v);
        for(int i=0;i<=sz[u];i++)t[i]=dp[u][i],dp[u][i]=0;
        for(int i=0;i<=sz[u];i++)
        for(int j=0;j<=sz[v];j++)
        (dp[u][i+j]+=t[i]*dp[v][j]%mod*p2(i*1ll*j-1)%mod)%=mod,
        (dp[u][i]+=t[i]*dp[v][j]%mod*(mod-1))%=mod;
        sz[u]+=sz[v];
    }sz[u]+=vc[u];
    for(int i=sz[u];i>=0;i--)
    dp[u][i]=i<vc[u]?0:dp[u][i-vc[u]];
}
int main(){
    cin>>n>>m;
    for(int i=1,u,v;i<=m;i++)
    scanf("%d%d",&u,&v),G[u].insert(v),G[v].insert(u);
    tarjan(1,0),solve(1);
    ll ans=0;
    for(int i=0;i<=n;i++)ans+=dp[1][i];
    cout<<ans%mod;
    return 0;
}