#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 505, mod = 1e9+7; 
int n, m, d[N], v[N]; 
vector <int> e[N]; 
unordered_map <int, int> f[N], g[N]; 

void solve () {
	cin >> n >> m; 
	for (int i = 1;i <= m;i++) {
		int x, y; cin >> x >> y; 
		x--; y--;
		if (x > y) swap(x, y); 
		e[y].pb(x); 
	}
	f[0][0] = 1; 
	for (int i = n-1; ~i; i--) {
		for (int p : e[i]) {
			for (int j = 0;j <= m;j++) g[j].clear(); 
			for (int j = 0;j <= m;j++) {
				for (auto z : f[j]) {
					if (z.fi>>i+1&1) continue; 
					(g[j+1][z.fi^(1<<p)^(1<<i)] += z.se) %= mod; 
					(g[j][z.fi] += z.se) %= mod; 
				}
			}
			swap(f, g); 
		}
			
	}
	for (int i = 0;i <= m;i++) {
		int ans = 0; 
		cout << f[i][0] << " "; 
	}
}

signed main () {
	int T = 1; 
	while (T--) solve();
	return 0;
}