#include <bits/stdc++.h>
#define uu (point[u])
#define vv (point[edge[e].first])
using  namespace std;
int const N=5e3+3,Mod=998244353;
typedef long long ll;
ll mi[N*N],f[N][N],tmp[N];
int n,m,dfn[N],low[N],tot=-1,num,sz[N],bian[N],point[N];
bool vis[N][N];
vector <int> g[N];
pair<int,bool> edge[N*N];
vector <int> tree[N];
void Tarjan(int u,int fa)
{
    dfn[u]=low[u]=++tot;
    for(int e:g[u])
    {
        int v=edge[e].first;
        if(v==fa) continue;
        if(!dfn[v])
        {
            Tarjan(v,u),low[u]=min(low[u],low[v]);
            if(dfn[u]<low[v]) edge[e].second=edge[e^1].second=1;
        }
        else low[u]=min(low[u],dfn[v]);
    }
}
void dfs(int u,int id)
{
    point[u]=id,sz[id]++;
    for(int e:g[u])
    {
        int v=edge[e].first;
        if(point[v] || edge[e].second==1) continue;
        dfs(v,id);
    }
}
inline void Init()
{
    mi[0]=1;
    for(int i=1;i<=n*n;++i) mi[i]=(mi[i-1]<<1)%Mod;
    Tarjan(1,1);
    for(int i=1;i<=n;++i) if(!point[i]) dfs(i,++num);
    for(int u=1;u<=n;++u)
        for(int e:g[u])
            if(edge[e].second==1) 
            {
                if(!vis[uu][vv]) vis[uu][vv]=1,tree[uu].push_back(vv);
            }
            else bian[uu]++;
}
void solve(int u,int fa)
{
    f[u][sz[u]]=mi[sz[u]*(sz[u]-1)/2-bian[u]/2];
    for(int v:tree[u])
    {
        if(v==fa) continue;
        solve(v,u);
        for(int i=1;i<=sz[u];++i) tmp[i]=f[u][i],f[u][i]=0;
        for(int i=sz[u];i>=1;--i)
            for(int j=sz[v];j>=1;--j)
            {
                f[u][i+j]=(f[u][i+j]+tmp[i]*f[v][j]%Mod*mi[i*j-1])%Mod;
                f[u][i]=(f[u][i]-tmp[i]*f[v][j]%Mod+Mod)%Mod;
            }
        sz[u]+=sz[v];
    }
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        g[x].push_back(++tot),edge[tot]={y,0},g[y].push_back(++tot),edge[tot]={x,0};
    }
    Init();
    solve(1,1);
    ll ans=0;
    for(int i=1;i<=n;++i) ans=(ans+f[1][i])%Mod;
    printf("%lld\n",ans);
    return 0;
}