// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
//#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m,k;
int e[55][55];
int f[1600005],g[1600005],pw[15];

void add(int&x,int y){
	x=(x+y)&3;
}

signed main()
{
	n=read(),m=read();
	pw[0]=1;
	For(i,1,13)pw[i]=pw[i-1]*3;
	For(i,1,m){
		int u=read(),v=read();
		e[u][v]=e[v][u]=1;
		k=max(k,max(u,v)-min(u,v));
	}
	
	int mxs=pw[k];
	f[0]=1;
	For(i,1,n){
		For(s,0,mxs-1)if(f[s]){
			add(g[(s*3)%mxs],f[s]);
			bool b1=0,b2=0;
			For(j,0,k-1)
				if(i-j-1>0 && e[i][i-j-1]){
					int t=s/pw[j]%3;
					if(t==1)b1=1;
					if(t==2)b2=1;
				}
			if(!b1) add(g[(s*3+2)%mxs],f[s]);
			if(!b2) add(g[(s*3+1)%mxs],f[s]);
		}
		For(s,0,mxs-1)f[s]=g[s],g[s]=0;
	//	For(s,0,mxs-1) cout<<f[s]<<" "; cout<<"\n";
	}
	
	int res=0;
	For(s,0,mxs-1) add(res,f[s]);
	add(res,3);
	assert(res%2==0);
	cout<<(res/2);
	return 0;
}
/*
0 0
1 0
2 0
0 1
0 2
1 1
2 2

0 0 0
1 0 0 (2)
0 1 0 (2)
0 0 2 (2)
1 1 0 (2)
0 1 1 (2)
1 0 2 (4)
1 1 1 (2)
*/