#include #define ll long long #define INF 1000000005 #define MOD 1000000007 #define EPS 1e-10 #define rep(i,n) for(int i=0;i<(int)(n);++i) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i) #define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i) #define each(a,b) for(auto& (a): (b)) #define all(v) (v).begin(),(v).end() #define len(v) (int)(v).size() #define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end()) #define cmx(x,y) x=max(x,y) #define cmn(x,y) x=min(x,y) #define fi first #define se second #define pb push_back #define show(x) cout<<#x<<" = "<<(x)< P; typedef pair pll; typedef vector vi; typedef vector vvi; typedef vector vl; typedef vector vvl; typedef vector vd; typedef vector

vp; typedef vector vs; const int MAX_N = 100005; vector G[MAX_N]; bool visit[MAX_N]; int dp[MAX_N]; int used[MAX_N]; void dfs(int u,int& cnt) { visit[u] = true; cnt++; each(v,G[u]){ if(!visit[v]){ dfs(v,cnt); } } } int main() { cin.tie(0); ios::sync_with_stdio(false); int n,m; cin >> n >> m; rep(i,m){ int a,b; cin >> a >> b; G[a-1].pb(b-1),G[b-1].pb(a-1); } map mp; rep(i,n){ if(!visit[i]){ int cnt = 0; dfs(i,cnt); mp[cnt]++; } } rep(i,n+1){ dp[i] = INF; } dp[0] = -1; each(it,mp){ memset(used,0,sizeof(used)); rep(i,n-it.fi+1){ if(dp[i] < INF && used[i] < it.se){ if(dp[i+it.fi] > dp[i] + 1){ used[i+it.fi] = used[i] + 1; dp[i+it.fi] = dp[i]+1; } } } } srep(i,1,n+1){ if(dp[i] == INF){ cout << "-1\n"; }else{ cout << dp[i] << "\n"; } } return 0; }