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;
long long n, m;
long long lit = 2000;
long long enough = 200;
vector<vector<long long> > rev(200500), con(200500);
vector<long long> color(200500, 0);
vector<bool> used(200500, false);
bool a[2002][2002];
void dfs(long long start, long long c) {
  used[start] = true;
  color[start] = c;
  for (long long i = 1; i <= n; i++) {
    if ((a[start][i]) && (!used[i]) && (color[i] == 0)) {
      dfs(i, c);
    }
  }
}
void dfs2(long long start, long long c) {
  used[start] = true;
  color[start] = c;
  for (long long i = 0; i < con[start].size(); i++) {
    long long Next = con[start][i];
    if ((!used[Next]) && (color[Next] == 0))
      dfs2(Next, c);
    else if (!used[Next] && color[Next] != 0 && color[Next] != c) {
      for (long long j = 1; j <= n; j++)
        if (color[j] == c) color[j] = color[Next];
    }
  }
}
int main() {
  cin >> n >> m;
  long long i, j;
  if (n <= lit) {
    for (i = 1; i <= n; i++) {
      for (j = 1; j <= n; j++) {
        a[i][j] = true;
      }
    }
    for (i = 0; i < m; i++) {
      long long q, w;
      cin >> q >> w;
      a[q][w] = false;
      a[w][q] = false;
    }
    long long cl = 0;
    for (i = 1; i <= n; i++) {
      if (color[i] == 0) {
        cl++;
        dfs(i, cl);
      }
    }
    cout << cl << endl;
    vector<long long> rez(cl + 1, 0);
    for (i = 1; i <= n; i++) {
      rez[color[i]]++;
    }
    sort(rez.begin() + 1, rez.end());
    for (i = 1; i < rez.size(); i++) cout << rez[i] << " ";
    return 0;
  }
  for (i = 0; i < m; i++) {
    long long q, w;
    cin >> q >> w;
    rev[q].push_back(w);
    rev[w].push_back(q);
  }
  long long col = 1;
  for (i = 1; i <= n; i++) {
    if (rev[i].size() < enough) color[i] = 1;
  }
  for (i = 1; i <= n; i++) {
    if (rev[i].size() >= enough) {
      vector<long long> temp(n + 2, 1);
      temp[i] = 0;
      for (j = 0; j < rev[i].size(); j++) {
        long long cur = rev[i][j];
        temp[cur] = 0;
      }
      for (j = 1; j <= n; j++) {
        if (temp[j]) {
          if (color[j] == 1) {
            color[i] = 1;
            con[i].clear();
            break;
          } else
            con[i].push_back(j);
        }
      }
    }
  }
  for (i = 1; i <= n; i++) {
    if (rev[i].size() == n - 1 && (color[i] == 0)) {
      col++;
      color[i] = col;
    } else if (rev[i].size() == 0) {
      cout << 1 << endl;
      cout << n;
      return 0;
    } else if ((rev[i].size() >= enough) && (color[i] == 0)) {
      col++;
      dfs2(i, col);
    }
  }
  bool need = false;
  for (i = 1; i <= n; i++) {
    if (color[i] == 0) need = true;
  }
  if (need) {
    col++;
    for (i = 1; i <= n; i++)
      if (color[i] == 0) color[i] = col;
  }
  vector<long long> ans(col + 1, 0);
  for (i = 1; i <= n; i++) {
    ans[color[i]]++;
  }
  sort(ans.begin() + 1, ans.end());
  long long cnt = 0;
  for (i = 1; i < ans.size(); i++)
    if (ans[i] > 0) cnt++;
  cout << cnt << endl;
  for (i = 1; i < ans.size(); i++)
    if (ans[i] > 0) cout << ans[i] << " ";
  return 0;
}
