#include<bits/stdc++.h>
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=15,Maxs=(1<<13)+10,mod=998244353;
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
int f[Maxn][Maxs],g[Maxn][Maxs],dp[Maxn][Maxn][Maxs];
int E[Maxn][Maxn],n,m;
inline void init(){
    n=read();m=read();
    while(m--){int x,y;x=read();y=read();E[x][y]=E[y][x]=1;}
}
inline int lowbit(int x){return x&(-x);}
inline void work(){
    fr(i,0,n-1) g[i+1][1<<i]=dp[i+1][i+1][1<<i]=1;
    int N=(1<<n)-1;
    int inv2=(mod+1)/2;
    fr(S,1,N){
        fr(i,1,n) fr(j,1,n) if(S&(1<<(i-1)) && S&(1<<(j-1))){
            int _N=S;_N^=(1<<(i-1));
            if(i!=j) _N^=(1<<(j-1));
            for(int T1=_N;;T1=(T1-1)&_N){
                int _S,_T;
                _S=T1|(1<<(i-1))|(1<<(j-1));_T=S^_S;
                if(!dp[i][j][_S]){
                    if(!T1) break;
                    continue;
                }
                fr(k,1,n) if(E[j][k] && f[k][_T]){
                    // cout<<"****"<<S<<' '<<_S<<' '<<_T<<' '<<1ll*dp[i][j][_S]*f[k][_T]%mod<<endl;
                    add(dp[i][k][S],1ll*dp[i][j][_S]*f[k][_T]%mod);
                }
                if(!T1) break;
            }
        }
        fr(i,1,n) fr(j,1,n) if(dp[i][j][S] && E[j][i]){
            // cout<<"*"<<i<<' '<<S<<' '<<dp[i][j][S]<<endl;
            add(g[i][S],1ll*dp[i][j][S]*inv2%mod);
        }
        fr(i,1,n) fr(j,1,n) if(i!=j && (S&(1<<(i-1))) && (S&(1<<(j-1))) && E[i][j]){
            // cout<<"**"<<i<<' '<<S<<' '<<f[j][S^(1<<(i-1))]<<endl;
            add(g[i][S],1ll*f[j][S^(1<<(i-1))]*inv2%mod);
        }
        // cout<<"G:"<<S<<' '<<1<<' '<<g[1][3]<<endl;
        // fr(i,1,n) g[i][S]=1ll*g[i][S]*inv2%mod;
        fr(i,1,n) add(f[i][S],g[i][S]);
        // cout<<S<<' '<<f[1][3]<<endl;
        fr(i,1,n) if(S&(1<<(i-1))){
            int _N=(S^(1<<(i-1)));
            for(int T1=_N;T1;T1=(T1-1)&_N){
                int _S,_T;_S=T1|(1<<(i-1));_T=(_N^T1)|(1<<(i-1));
                if(_S>_T) continue;
                add(f[i][S],1ll*f[i][_S]*g[i][_T]%mod);
            }
        }
    }
    // cerr<<"**"<<endl;
    // fr(S,1,N) fr(i,1,n) if(g[i][S]) cout<<S<<' '<<i<<' '<<g[i][S]<<endl;
    // puts("");
    // fr(S,1,N) fr(i,1,n) if(f[i][S]) cout<<S<<' '<<i<<' '<<f[i][S]<<endl;
    // fr(S,1,N) fr(i,1,n) fr(j,1,n) if(dp[i][j][S]) cout<<S<<' '<<i<<' '<<j<<' '<<dp[i][j][S]<<endl;
    // cerr<<f[1][N]<<endl;
    writeln(f[1][N]);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}