#include <bits/stdc++.h>

using namespace std;

const int kMaxN = 21;
const int kMaxM = 50;
const int kMaxPowN = (1 << 20) + 1;

const int kMod = 1e9 + 7;

int n, m;

int u[kMaxM], v[kMaxM];

int f[2][kMaxPowN][kMaxM];

void add(int &x, int y) {
	x += y;
	if (x >= kMod) x -= kMod;
}

int main() {
	cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		cin >> u[i] >> v[i];
	}
	f[0][0][0] = 1;
	for (int i = 1; i <= m; ++i) {
		for (int j = 0; j < (1 << n); ++j) {
			for (int k = 0; k <= m; ++k) {
				f[i & 1][j][k] = 0;
				add(f[i & 1][j][k], f[i - 1 & 1][j][k]);
				if (k) add(f[i & 1][j][k], f[i - 1 & 1][j ^ (1 << u[i] - 1) ^ (1 << v[i] - 1)][k - 1]);
			}
		}
	}
	for (int i = 0; i <= m; ++i)
		cout << f[m & 1][0][i] << ' ';
	cout << '\n';
	return 0;
}