#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int mod = 1e9 + 7;
struct Mint {
  int val;
  Mint(ll x = 0): val((x % mod + mod) % mod) {;}
  Mint operator +(const Mint& x) { return Mint(val + x.val); }
  Mint operator -(const Mint& x) { return Mint(val - x.val); }
  Mint operator *(const Mint& x) { return Mint((ll)val * x.val); }
  Mint operator +=(const Mint& x) { return *this = Mint(val + x.val); }
  Mint operator -=(const Mint& x) { return *this = Mint(val - x.val); }
  Mint operator *=(const Mint& x) { return *this = Mint((ll)val * x.val); }
  Mint operator ^(const int& _b) const {
    Mint accum = 1, a = *this;
    int b = _b;
    while(b) {
      accum = (b & 1? accum * a : accum);
      a *= a;
      b >>= 1;
    }
    return accum;
  }
  Mint operator /(const Mint& x) { return Mint((ll)val * (x ^ (mod - 2)).val); }
  Mint operator /=(const Mint& x) { return *this = Mint((ll)val * (x ^ (mod - 2)).val); }
};

const int nmax = 25, mmax = nmax * (nmax - 1) / 2;

vector<pii> edgs;

struct PM { 
   int plus, minus;
   PM(int a = 0, int b = 0): plus(a), minus(b) {;}
   PM flip() { return PM(minus, plus); }
   PM operator +(const PM& x) { 
      return PM(plus + x.plus, minus + x.minus);
   }
};

PM wht[1 << nmax];

Mint dp[mmax + 1][mmax];
Mint rez[mmax];

void init(int m) {
   const int mmax = m;
   for(int i = 0; i <= mmax; i++) {
      dp[i][0] = 1;
      for(int j = 0; j < i; j++) {
         for(int h = mmax - 2; h >= 0; h--)
            dp[i][h + 1] += dp[i][h];
      }
      
      for(int j = 0; j < mmax - i; j++) {
         for(int h = mmax - 2; h >= 0; h--)
            dp[i][h + 1] -= dp[i][h];
      }
   }
   return;
}

Mint cnt[mmax];

signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   int n, m;
   cin >> n >> m;
   init(m);
   
   edgs.resize(m);
   for(auto &[a, b] : edgs) cin >> a >> b, --a, --b, wht[(1 << a) | (1 << b)].plus++;
   
   for(int step = 0; step < n; step++) {
      for(int i = 0; i < (1 << n); i++) {
         if(i & (1 << step)) continue;
         tie(wht[i], wht[i ^ (1 << step)]) = make_pair(wht[i] + wht[i ^ (1 << step)], wht[i] + wht[i ^ (1 << step)].flip());
      }
   }
   
   for(int i = 0; i < (1 << n); i++) {
      cnt[wht[i].plus] += 1;
   }
   for(int i = 0; i <= m; i++) {
      for(int p = 0; p <= m; p++) {
         rez[p] += dp[i][p] * cnt[i];
      }
   }
   
   
   for(int i = 0; i <= m; i++)
      cout << (rez[i] * ((Mint(1) / Mint(2)) ^ n)).val << ' ';
   cout << '\n';
   
   
}

/**
      Istenem! Nu poate fi real.
-- Surse verificate
*/