7 20
4 6
6 7
4 5
1 2
2 4
1 7
3 5
2 1
6 2
6 1
7 3
3 2
3 6
3 1
3 4
2 5
1 6
7 4
6 3
7 5
 8 23
1 2
1 4
1 6
1 8
2 3
2 4
2 5
2 6
2 7
2 8
3 4
3 5
3 6
3 7
3 8
4 5
4 6
4 7
5 6
5 7
5 8
6 8
7 8
 4 4
2 1
3 1
1 4
3 2
 8 18
1 4
1 6
1 7
2 3
2 4
2 5
2 6
2 7
2 8
3 4
3 8
4 7
5 6
5 7
5 8
6 7
6 8
7 8
 10 34
7 10
2 3
2 4
2 5
9 10
2 7
2 8
2 10
4 5
4 6
4 7
4 8
4 9
6 7
6 8
6 9
6 10
1 2
1 3
1 5
8 9
1 6
1 7
1 8
1 9
1 10
3 4
3 5
3 6
3 8
3 10
5 6
5 9
5 10
 5 7
1 2
2 3
3 4
1 5
2 5
3 5
4 5
 2 0
 8 23
2 7
7 5
8 6
8 2
6 3
3 5
8 1
8 4
8 3
3 4
1 2
2 6
5 2
6 4
7 6
6 5
7 8
7 1
5 4
3 7
1 4
3 1
3 2
 2 1
1 2
 6 9
1 2
1 4
1 5
2 3
2 5
2 6
3 5
4 6
5 6
 12 56
9 5
2 6
9 8
5 4
1 11
1 6
4 1
1 10
10 3
8 4
5 1
9 1
5 10
2 7
11 5
6 11
5 8
7 6
3 2
12 7
8 6
12 3
1 2
8 1
2 11
10 12
4 6
5 12
2 4
10 2
7 3
12 11
7 10
7 1
9 2
11 9
9 10
8 7
11 3
7 9
5 7
4 12
3 5
12 2
4 10
9 12
5 2
9 4
11 8
8 2
3 6
4 11
8 10
6 10
3 9
3 4
 12 58
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 10
1 11
1 12
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
4 5
4 6
4 8
4 11
4 12
5 6
5 7
5 8
5 9
5 10
5 11
6 7
6 8
6 9
6 10
6 11
6 12
7 8
7 9
7 10
7 11
7 12
8 9
8 10
8 11
9 10
9 11
9 12
10 12
 4 3
2 1
3 1
4 2
 3 1
2 3
 6 10
1 2
1 3
1 4
1 6
2 3
2 4
2 5
3 5
3 6
4 6
 11 49
10 3
6 4
11 3
7 6
10 6
6 1
4 3
10 2
4 5
9 2
10 1
5 7
1 5
9 7
2 11
8 6
3 9
2 5
9 5
6 5
1 4
11 9
1 7
8 10
3 6
3 7
11 5
6 9
4 10
8 7
4 9
8 2
4 2
8 11
7 4
9 10
8 1
10 7
3 2
5 8
8 9
1 3
2 7
10 11
5 3
10 5
4 11
1 11
8 3
 5 4
1 4
2 3
4 3
4 2
 4 3
1 2
3 1
4 3
 4 3
1 3
1 4
2 3
 10 36
7 8
7 9
2 3
2 4
2 5
9 10
2 7
2 8
2 9
2 10
4 5
4 6
4 7
4 8
4 10
6 7
6 9
6 10
1 2
1 3
1 4
8 9
1 5
8 10
1 7
1 8
1 9
1 10
3 4
3 6
3 7
3 9
5 6
5 7
5 9
5 10
 8 15
2 1
4 5
2 4
3 4
2 5
3 5
2 6
3 6
5 6
4 6
2 7
3 8
2 8
3 7
6 7

3
1 2 4 
 3
1 2 5 
 2
1 3 
 1
8 
 1
10 
 2
1 4 
 1
2 
 3
1 3 4 
 2
1 1 
 1
6 
 3
1 4 7 
 4
1 1 1 9 
 1
4 
 1
3 
 1
6 
 5
1 1 1 2 6 
 1
5 
 1
4 
 1
4 
 2
2 8 
 1
8 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = std::vector<int>;
using vll = std::vector<long long>;
using vull = std::vector<unsigned long long>;
void setIO(const std::string name = "") {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  if (!name.empty()) {
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
  }
}
class Timer {
  std::chrono::time_point<std::chrono::high_resolution_clock> m_beg;

 public:
  Timer() : m_beg(std::chrono::high_resolution_clock::now()) {}
  void reset() { m_beg = std::chrono::high_resolution_clock::now(); }
  [[nodiscard]] long double elapsed() const {
    return std::chrono::duration_cast<
               std::chrono::duration<long double, std::ratio<1>>>(
               std::chrono::high_resolution_clock::now() - m_beg)
        .count();
  }
};
template <class T>
class DFSwithComponents {
  vector<vector<T>> adjList;
  vector<bool> visited;

 public:
  DFSwithComponents(const T size) { adjList.resize(size); }
  void addEdge(const T u, const T v) { adjList[u].push_back(v); }
  vector<T> explore() {
    visited.clear();
    visited.resize(adjList.size(), false);
    T componentNumber = 0;
    vector<T> finals;
    for (T i = 0; i < adjList.size(); i++)
      if (!visited[i]) {
        T count = 1;
        stack<T> s;
        visited[i] = true;
        s.push(i);
        while (!s.empty()) {
          auto top = s.top();
          s.pop();
          for (auto& neighbor : adjList[top])
            if (!visited[neighbor]) {
              count++;
              visited[neighbor] = true;
              s.push(neighbor);
            }
        }
        finals.push_back(count);
      }
    return finals;
  }
  vector<T> getAdjList(const T index) { return adjList[index]; }
  vector<bool> getVisited() { return visited; }
};
int main(int argc, char* argv[]) {
  unsigned short n, m;
  cin >> n >> m;
  DFSwithComponents<int> d(n);
  map<pair<unsigned short, unsigned short>, bool> pairs;
  for (auto i = (0); i < (m); ++i) {
    unsigned short a, b;
    cin >> a >> b;
    a--;
    b--;
    pairs[{min(a, b), max(a, b)}] = true;
  }
  for (unsigned short i = 0; i < n; i++) {
    for (unsigned short j = i + 1; j < n; j++) {
      if (pairs.find({i, j}) == pairs.end()) {
        d.addEdge(i, j);
        d.addEdge(j, i);
      }
    }
  }
  auto comps = d.explore();
  sort((comps).begin(), (comps).end());
  cout << comps.size() << '\n';
  for (auto& comp : comps) cout << comp << ' ';
}
