#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 nmax = 26;

vector<pii> edgs;

int rez[nmax];

void bkt(int ones, int twos, int p) {
   if(p == sz(edgs)) {
      if(ones) return;
      rez[__builtin_popcount(twos)]++;
      return;
   }
   bkt(ones, twos, p + 1);
   int a = (1 << edgs[p].first), b = (1 << edgs[p].second);
   if(twos & a) return;
   else if(ones & a) ones &= ~a, twos |= a;
   else ones |= a;
   if(twos & b) return;
   else if(ones & b) ones &= ~b, twos |= b;
   else ones |= b;
   
   bkt(ones, twos, p + 1);
}

signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   int n, m;
   cin >> n >> m;
   edgs.resize(m);
   for(auto &[a, b] : edgs) cin >> a >> b, --a, --b;
   bkt(0, 0, 0);
   
   for(int i = 0; i <= n; i++)
      cout << rez[i] << ' ';
   cout << '\n';
   
   
}

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