#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=__uint128_t;
const int N=1e3+5,M=N*100+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const int INF=1e9+7;mt19937 rnd(263082);
int n,m,A[N][N],del[N];
ll calc(){
	ll ans=1;int i,j,h;
	for(i=1;i<=n;i++)if(!del[i]){
		ans=ans*2%mod;
		int p=0;for(j=i+1;j<=n;j++) if(A[i][j]) {p=j;break;}
		if(!p){
			if(A[i][i]) return 0;continue;
		}
		del[p]=1;
		for(j=i+1;j<p;j++) if(A[j][p]) for(h=p;h<=n;h++) A[j][h]^=A[i][h];
		for(j=p+1;j<=n;j++) if(A[p][j]) for(h=p+1;h<=n;h++) A[min(h,j)][max(h,j)]^=A[i][h];
		if(A[i][i]){
			if(A[p][p]){
				ans=mod-ans;
				for(j=p+1;j<=n;j++) A[j][j]^=A[p][j];
			} 
			for(j=p+1;j<=n;j++) A[j][j]^=A[i][j]^A[p][j];
		}
	}
	return ans;
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	while(m--){
		int x,y;scanf("%d%d",&x,&y);A[min(x,y)][max(x,y)]=1;
	}
	ll tot=1;for(i=1;i<=n;i++) tot=tot*2%mod;
	printf("%lld\n",(tot+calc())%mod*(mod+1)/2%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}