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;
//FUCK.......MISSED AN EASY ONE ....SHITTT

#define int long long
//#define ll long long
#define N 300005
#define Z 251000
#define M 1000000007
#define pi pair<int,int>
#define F first
#define S second
#define pb push_back
#define ld long double
#define inf (int)100000000LL*1000000LL
#define pi2 pair<string,int>
#define bs 400
#define si(n) scanf("%I64d",&n)
#define pr(n) printf("%I64d\n",n)
//||

//"\n"
set<int> temp,temp2;
set<int> :: iterator it;
vector<int> temp3,graph[N],out;
vector<pi> ed;
int cnt[N],cnt2[N],pre[N];
int Find(int x)
{
    if(x!=pre[x])
        return pre[x]=Find(pre[x]);
    return pre[x];
}

int Union(int x,int y)
{
    x=Find(x);
    y=Find(y);
    if(x!=y)
        pre[x]=y;
    return 0;
}
main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m,i,x,y,mx=N,ind=-1,j,k;

    cin>>n>>m;

    for(i=0;i<m;i++)
    {
        cin>>x>>y;
        graph[x].pb(y);
        graph[y].pb(x);
    }
    for(i=1;i<=n;i++)
        sort(graph[i].begin(),graph[i].end());
    for(i=1;i<=n;i++)
    {
      if(mx>graph[i].size())
      {
          mx=graph[i].size();
          ind=i;
      }
    }
    cnt[ind]=1;
  //  cout<<ind<<endl;
    temp.insert(ind);
    for(i=1;i<=n;i++)
    {

        if(ind!=i && !binary_search(graph[ind].begin(),graph[ind].end(),i))
        {
            cnt[i]=1;
            temp.insert(i);
           // cout<<i<<endl;
        }
    }
    for(i=1;i<=n;i++)
    {
        if(!cnt[i])
            temp2.insert(i);
    }
   // cout<<binary_search(graph[3].begin(),graph[3].end(),2);
    while(temp.size() && temp2.size())
    {
       int x=*temp.begin();
       temp3.clear();

       for(it=temp2.begin();it!=temp2.end();it++)
       {
           int y=*it;
            if(!binary_search(graph[x].begin(),graph[x].end(),y))
            {
                temp3.pb(y);
                temp.insert(y);
               // cout<<y<<" "<<x<<endl;
                cnt[y]=1;
            }
       }
       temp.erase(x);
       for(j=0;j<temp3.size();j++)
        temp2.erase(temp3[j]);

    }
  //  cout<<cnt[5]<<endl;
    int ans1=0;
    temp.clear();
    temp2.clear();
    temp3.clear();
     for(i=1;i<=n;i++)
     {
         pre[i]=i;
         if(cnt[i])
            ans1++;
         else
            temp3.pb(i);
     }
  // cout<<ans1<<" ";
out.pb(ans1);
    for(j=0;j<temp3.size();j++)
        for(k=j+1;k<temp3.size();k++)
    {
           if(!binary_search(graph[temp3[j]].begin(),graph[temp3[j]].end(),temp3[k]))
              ed.pb({temp3[j],temp3[k]});
    }

    for(i=0;i<ed.size();i++)
    {
        Union(ed[i].F,ed[i].S);
    }
    for(i=1;i<=n;i++)
    {
        if(!cnt[i])
        {
            cnt2[Find(i)]++;
        }
    }
    for(i=1;i<=n;i++)
    {
        if(cnt2[i])
            //cout<<cnt2[i]<<" ";
            out.pb(cnt2[i]);
    }
    cout<<out.size()<<endl;
    for(i=0;i<out.size();i++)
        cout<<out[i]<<" ";
    return 0;
}
