#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
using namespace std;
int n,m,tot;
int deg[200005];
int hd[200005],nxt[400005],to[400005],tt=1;
map<pii,int>vis; 
vector<int>vec[200005];
queue<int>q;
vector<pii>e[200005];
set<int>E[200005];
pii stke[400050];
int taile;
int stk[200500],tail,dfn[200005],low[200005],tt1;
void add(int u,int v){
    nxt[++tt]=hd[u],hd[u]=tt,to[tt]=v;
    nxt[++tt]=hd[v],hd[v]=tt,to[tt]=u;
}
void tarjan(int u,int id){
	dfn[u]=low[u]=++tt1,stk[++tail]=u;
	for(int i=hd[u],v;i;i=nxt[i]){
		v=to[i];if((i^1)==id)continue;
	    if(!dfn[v]){
	    	stke[++taile]=mp(u,v);
	    	tarjan(v,i),low[u]=min(low[u],low[v]);
	    	if(low[v]>=dfn[u]){
	    		++tot;
	    		while(1){
	    			int p=stk[tail--];
	    			++deg[p];
	    			vec[tot].pb(p);
	    			if(p==v)break;
				}vec[tot].pb(u);
				++deg[u];
				while(1){
					pii now=stke[taile--];
					e[tot].pb(now);
					if(now.fi==u){
						assert(now.se==v);
						break;
					}
				}
			}
		}else {
			stke[++taile]=mp(u,v);
			low[u]=min(low[u],dfn[v]);
		}
	}
}
const int mod=1e9+7;
int mul(int x,int y){return 1ll*x*y%mod;}
int fac[200005];
void p0(){puts("0"),exit(0);}
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;++i){
		int u,v;scanf("%d%d",&u,&v);
		if(u>v)swap(u,v);
		if(vis.count(mp(u,v)))continue;
		vis[mp(u,v)]=1;
		add(u,v);
	}
	fac[0]=1;
	for(int i=1;i<=n;++i)fac[i]=mul(i,fac[i-1]);
	tarjan(1,-1);int ans=n;
	for(int i=1;i<=n;++i)ans=mul(ans,fac[deg[i]]);
	memset(deg,0,sizeof(deg));
	for(int i=1;i<=tot;++i){
		if(vec[i].size()<=2)continue;
		ans=mul(ans,2);
		for(int v:vec[i])deg[v]=0,E[v].clear();
		for(auto v:e[i])E[v.fi].insert(v.se),E[v.se].insert(v.fi);
		for(int v:vec[i]){
			deg[v]=E[v].size();
			if(deg[v]==2)q.push(v);
		}
		int Ct=vec[i].size();
		while(!q.empty()){
			int u=q.front();q.pop();
			if(deg[u]!=2)continue;--Ct;deg[u]=0;
			int p=(*E[u].begin()),x=(*(--E[u].end()));
			E[p].erase(u),E[x].erase(u);
			--deg[p],--deg[x];
			if(!E[p].count(x)&&!E[x].count(p)){
				++deg[p],++deg[x];
				E[p].insert(x),E[x].insert(p);
			}
			if(deg[p]==2)q.push(p);
			if(deg[x]==2)q.push(x);
		}
		if(Ct>2){
if(m==350)for(auto v:e[i])cout<<v.fi<<" "<<v.se<<endl;
p0();               
}
	}cout<<ans<<endl;
	return 0;
}