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 



import java.io.*;
import java.util.*;

public class E920 {
    static public class DisjointSet {

        private Map<Long, Node> map = new HashMap<>();

        class Node {
            long data;
            Node parent;
            int rank;

            @Override
            public String toString() {
                return findSet(data) + "";
            }
        }


        /**
         * Create a set with only one element.
         */
        public void makeSet(long data) {
            Node node = new Node();
            node.data = data;
            node.parent = node;
            node.rank = 0;
            map.put(data, node);
        }

        /**
         * Combines two sets together to one.
         * Does union by rank
         *
         * @return true if data1 and data2 are in different set before union else false.
         */
        public boolean union(long data1, long data2) {
            Node node1 = map.get(data1);
            Node node2 = map.get(data2);

            Node parent1 = findSet(node1);
            Node parent2 = findSet(node2);

            //if they are part of same set do nothing
            if (parent1.data == parent2.data) {
                return false;
            }

            //else whoever's rank is higher becomes parent of other
            if (parent1.data > parent2.data) {
                //increment rank only if both sets have same rank
                parent1.rank = (parent1.rank == parent2.rank) ? parent1.rank + 1 : parent1.rank;
                parent2.parent = parent1;
            } else {
                parent1.parent = parent2;
            }
            return true;
        }

        /**
         * Finds the representative of this set
         */
        public long findSet(long data) {
            return findSet(map.get(data)).data;
        }

        /**
         * Find the representative recursively and does path
         * compression as well.
         */
        private Node findSet(Node node) {
            Node parent = node.parent;
            if (parent == node) {
                return parent;
            }
            node.parent = findSet(node.parent);
            return node.parent;
        }
    }

    static class Graph {
        int vertices;
        Set<Integer>[] edge;
        DisjointSet disjointSet = new DisjointSet();
        static Queue<Integer> unvisited = new ArrayDeque<>();
        static int count = 0;

        Graph(int vertices) throws IOException {
            this.vertices = vertices;
            edge = new HashSet[vertices + 1];
            for (int i = 1; i <= vertices; i++) {
                edge[i] = new HashSet<>();
                disjointSet.makeSet(i);
                unvisited.add(i);
            }
        }

        void addEdge(int a, int b) {
            edge[a].add(b);
            edge[b].add(a);
        }

        void dfs() throws IOException {
            boolean[] visited = new boolean[vertices + 1];
            while (unvisited.size()>0) {
                int j = unvisited.poll();
                dfsUtil(j,visited,j);
            }

            Set<Integer> set = new HashSet<>();
            Map<Integer, Integer> map = new HashMap<>();
            for (
                    int i = 1;
                    i <= vertices; i++) {
                int a = (int) disjointSet.findSet(i);
                if (set.contains(a)) {
                    map.put(a, map.get(a) + 1);
                } else {
                    map.put(a, 1);
                    set.add(a);
                }
            }

            Iterator<Integer> iterator = set.iterator();
            out.write(set.size() + "\n");
            ArrayList<Integer> list = new ArrayList<>();
            while (iterator.hasNext()) {
                list.add(map.get(iterator.next()));
            }
            Collections.sort(list);
            for (
                    int i = 0; i < list.size(); i++) {
                out.write(list.get(i) + " ");
            }
            out.flush();
            //System.out.println(disjointSet.map);
        }

        private void dfsUtil(int v, boolean[] visited, int parernt) {
            //System.out.println(unvisited);
            visited[v] = true;
            disjointSet.union(parernt, v);
            Set<Integer> check = new HashSet<>();
            while (unvisited.size()>0){
                //System.out.println(unvisited);
                int a = unvisited.poll();
                if(!edge[v].contains(a)){
                    dfsUtil(a,visited,parernt);
                }
                else{
                    unvisited.add(a);
                    if(check.contains(a)){
                        return;
                    }
                    else{
                        check.add(a);
                    }

                }
            }
        }

    }

    static BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
    static BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));


    public static void main(String[] args) throws IOException {

        String[] s1 = inp.readLine().split(" ");
        int v = Integer.parseInt(s1[0]);
        int e = Integer.parseInt(s1[1]);
        Graph graph = new Graph(v);
        for(int i=0;i<e;i++){
            s1 = inp.readLine().split(" ");
            int a = Integer.parseInt(s1[0]);
            int b = Integer.parseInt(s1[1]);
            graph.addEdge(a,b);
        }
        graph.dfs();

    }
}
