#include<bits/stdc++.h>
#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)
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=30,Maxm=Maxn*Maxn,mod=1e9+7;
inline int ksm(int x,int y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }
    return sum;
}
inline void add(int &x,int y){
    x+=y;if(x>=mod) x-=mod;
}
bitset<Maxm> st[Maxn],now;
int n,m;
int siz[Maxm];
inline void init(){
    n=read();m=read();
    fr(i,1,m){
        int x,y;
        x=read(),y=read();--x,--y;
        st[x][i-1]=1;st[y][i-1]=1;
    }
}
int N;
int id[(1<<20)+10];
int C[Maxn][Maxn];
int ans[Maxn];
inline void work(){
    C[0][0]=1;
    fr(i,1,m){
        C[i][0]=1;
        fr(j,1,i) C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
    }
    // cout<<C[1][1]<<endl;
    N=(1<<n)-1;
    fr(i,1,n) id[1<<i]=i;
    fr(i,0,N){
        if(i){
            int A,B;
            A=(i-1)^((i-1)>>1);B=i^(i>>1);
            // cout<<A<<' '<<B<<endl;
            now^=st[id[A^B]];
        }
        // cout<<i<<' '<<now<<endl;
        // cout<<i<<' '<<now.count()<<endl;
        siz[now.count()]++;
    }
    // fr(i,0,m) cout<<i<<' '<<siz[i]<<endl;
    fr(i,0,m) fr(p1,0,m-i) fr(p2,0,i){
        if(p1&1) add(ans[p1+p2],mod-1ll*C[m-i][p1]*C[i][p2]%mod*siz[m-i]%mod);
        else add(ans[p1+p2],1ll*C[m-i][p1]*C[i][p2]%mod*siz[m-i]%mod);
    }
    // fr(i,0,m) cout<<i<<' '<<ans[i]<<endl;
    fr(i,0,m){
        int answer;
        answer=1ll*ans[i]*ksm(ksm(2,n))%mod;
        writepl(answer);
    }
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}