http://acm.hdu.edu.cn/showproblem.php?pid=6736
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=3e5+9;
const int mod=998244353;
vector<int>g[maxn];
void addedge(int u,int v)
{
g[u].pb(v);
}
int n,m;
ll deep[maxn];
bool vis[maxn];
vector<ll>ans;
void dfs(int u,ll d,int fa)
{
if(vis[u]&&d>=deep[u])
{
//cout<<u<<" "<<d<<endl;
ans.pb(d-deep[u]);
return ;
}
if(vis[u]) return ;
deep[u]=d;
vis[u]=1;
for(int i=0;i<g[u].size();i++)
{
int v=g[u][i];
if(v==fa) continue;
dfs(v,d+1,u);
}
}
ll ksm(ll x,ll n)
{
ll res=1;
while(n)
{
if(n&1) res=res*x%mod;
n>>=1;
x=x*x%mod;
}
return res;
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
while(~scanf("%d%d",&n,&m))
{
for(int i=0;i<=n;i++) vis[i]=0,g[i].clear(),deep[i]=0;
ans.clear();
for(int i=0;i<m;i++)
{
int u,v;
scanf("%d%d",&u,&v);
addedge(u,v);
addedge(v,u);
}
if(n==1)
{
printf("0\n");
continue;
}
if(n==2)
{
if(m==0)
{
printf("0\n");
continue;
}
else
{
printf("1\n");
continue;
}
}
for(int i=1;i<=n;i++)
{
if(!vis[i])
{
dfs(i,1,i);
}
}
ll res=1;
ll cnt=0;
for(int i=0;i<ans.size();i++)
{
//cout<<ans[i]<<endl;
cnt+=ans[i];
res=res*((ksm(2LL,ans[i])-1+mod)%mod);
res%=mod;
}
ll yi=m-cnt;
if(yi>0)
{
res=res*ksm(2LL,yi)%mod;
}
printf("%lld\n",res);
}
return 0;
}