#include <bits/stdc++.h>
#define For(i, a, b) for (int i = a; i <= b; ++i)
#define Rep(i, a, b) for (int i = a; i >= b; --i)
using namespace std;
const int maxN = 2e3 + 5;
using u64 = unsigned long long;
int n, m, dep[maxN];
vector<int> G[maxN];
mt19937_64 Rnd(10924223);
u64 hs[maxN];
int tot;
void dfs(int x, int fa) {
  dep[x] = dep[fa] + 1;
  for (int s : G[x]) {
    if (s == fa) continue;
    if (dep[s]) {
      if (dep[s] < dep[x]) {
        u64 R = Rnd(); 
        hs[x] ^= R;
        hs[s] ^= R;
        hs[++tot] = R;
      }
      continue;
    } 
    dfs(s, x);
  }
  for (int s : G[x]) {
    if (dep[s] == dep[x] + 1) hs[x] ^= hs[s];
  }
}
int main() {
  scanf("%d%d", &n, &m);
  For (i, 1, m) {
    int x, y;
    scanf("%d%d", &x, &y);
    G[x].emplace_back(y); G[y].emplace_back(x);
  }
  tot = n;
  For (i, 1, n) {
    if (!dep[i]) dfs(i, 0);
  }
  sort(hs + 1, hs + tot + 1);
  int lst = 0, g = 0;
  For (i, 1, tot + 1) {
    if (hs[i] == 0) { lst = i; continue;  }
    if (hs[i] != hs[i + 1]) {
      g = __gcd(g, i - lst);
      lst = i;
    }
  }
  For (i, 1, m) {
    if (g % i == 0) printf("%d ", i);
  }
  return 0;
}