#include<iostream>
#include<cstdio>
#include<bitset>
#define N 1001
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
int n,m,inv2=(mod+1)>>1,F[N+1],res=1,ans=1;
bitset<N+1>B[N+1];
bool used[N+1];
int main()
{
	int x,y;
	n=read(),m=read();
	for (int i=1;i<=n;++i) F[i]=1,res=2ll*res%mod;
	for (int i=1;i<=m;++i)
	{
		x=read(),y=read();
		if (x>y) swap(x,y);
		B[x][y]=B[y][x]=1;
	}
	for (int i=1;i<=n;++i)
		for (int j=i+1;j<=n;++j)
			if (!used[i]&&!used[j]&&B[i][j])
			{
				used[i]=used[j]=1,ans=2ll*ans%mod;
				if (B[i][i])
				{
					for (int t=1;t<=n;++t)
						if (B[j][t])
							B[t][t]=B[t][t]^1;
				}
				if (B[j][j])
				{
					for (int t=1;t<=n;++t)
						if (B[i][t])
							B[t][t]=B[t][t]^1;
				}
				if (B[i][i]&&B[j][j]) ans=MD2(-ans);
				for (int k=1;k<=n;++k)
					if (!used[k])
						for (int t=1;t<=n;++t)
							if (!used[t]&&B[i][k]&&B[j][t])
							{
								B[k][t]=B[k][t]^1;
								if (k!=t) B[t][k]=B[t][k]^1;
							}
				break;
			}
	for (int i=1;i<=n;++i)
		if (!used[i])
		{
			if (!B[i][i]) ans=2ll*ans%mod;
			else ans=0;
		}
	printf("%lld\n",1ll*(res+ans)*inv2%mod);
	return 0;
}