#include "Anyalib.h"
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()

vector<int> bfsA(vector<vector<int>> G){
    int N=G.size();
    vector<int> dis(N,-1);
    dis[0]=0;
    queue<int> que;
    que.push(0);
    while(!que.empty()){
        int v=que.front();
        que.pop();
        for(int nv:G[v]){
            if(dis[nv]!=-1) continue;
            dis[nv]=dis[v]+1;
            que.push(nv);
        }
    }
    return dis;
}

int NA;
vector<vector<int>> GA(550);
vector<int> disA;
vector<int> EA(550);

void InitAnya(int N , int A[] , int B[]) {
  NA=N;
  rep(i,N) GA[A[i]].push_back(B[i]);
  rep(i,N) GA[B[i]].push_back(A[i]);
  disA=bfsA(GA);
  rep(i,N){
    if(disA[A[i]]>disA[B[i]]) EA[A[i]]=i;
    if(disA[B[i]]>disA[A[i]]) EA[B[i]]=i;
  }
}

void Anya(int C[]) {
  int N=NA;
  vector<int> disnow(N,-1);
  disnow[0]=0;
  queue<int> que;
  que.push(0);
  while(!que.empty()){
    int v=que.front();
    que.pop();
    for(int nv:GA[v]){
      if(disnow[nv]!=-1) continue;
      disnow[nv]=disnow[v]+C[EA[nv]];
      que.push(nv);
    }
  }
  vector<int> cnt(12,0);
  rep(i,N) cnt[disA[i]%12]++;
  int min_val=550,id_val=-1;
  rep(i,12){
    if(min_val>cnt[i]){
      min_val=cnt[i];
      id_val=i;
    }
  }
  int now=0;
  rep(i,N){
    if(i==0||disA[i]%12==id_val){
      int x=disnow[i];
      rep(j,9){
        Save(now,x%2);
        x/=2;
        now++;
      }
    }else{
      Save(now,C[EA[i]]);
      now++;
    }
  }
}
/*#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 400005
#define inf 0x3f3f3f3f

int n,m;
vi e[maxn];
int p[maxn],vis[maxn],num[maxn],rnk[maxn];
vi buc[maxn];
set<int>st[maxn];

void make(){
	For(i,1,n)buc[0].pb(i);
	int id=0;
	For(i,1,n){
		int u=0;
		while(!u){
			while(buc[id].size()){
				if(!vis[buc[id].back()]){u=buc[id].back();break;}
				buc[id].pop_back();
			}
			if(!u)--id;
		}
		p[n-i+1]=u,vis[u]=1;
		for(int v:e[u])
			if(!vis[v])++num[v],id=max(id,num[v]),buc[num[v]].pb(v);
	}
	For(i,1,n)rnk[p[i]]=i;
}

int par[maxn];
void find(int u,int v,int w){
	queue<int>q;
	q.push(w);
	For(i,1,n)vis[i]=0;
	vis[w]=1; par[w]=0;
	while(q.size()){
		int x=q.front();q.pop();
		for(int y:e[x]){
			if(vis[y]||y==u||(y!=v&&st[u].count(y)))continue;
			vis[y]=1,q.push(y),par[y]=x;
		}
	}
	vi o={w,u};
	for(int x=v;x!=w;x=par[x])o.pb(x);
	cout<<o.size()<<'\n';
	for(auto x:o)cout<<x-1<<" ";cout<<"\n";
}

void work()
{
	if(!n&&!m)exit(0);
	For(i,0,n)buc[i].clear(),e[i].clear(),st[i].clear(),vis[i]=num[i]=0; 
	For(i,1,m){
		int u=read()+1,v=read()+1;
		e[u].pb(v),e[v].pb(u);
		st[u].insert(v),st[v].insert(u);
	}
	make();
	For(i,1,n)vis[i]=0;
	Rep(i,n,1){
		int u=p[i],mn=inf,pos;
		vi o;
		for(int v:e[u])
			if(rnk[v]>rnk[u]){
				o.pb(v);
				if(rnk[v]<mn)mn=rnk[v],pos=v;
			}
		// pos : latest (v)
		// x : w
		
		if(o.size()){
			for(int x:o)
				if(x!=pos&&!st[pos].count(x)){
					puts("NO");
					find(u,pos,x);
					return;
				}
		}
	}
	puts("YES");
	For(i,1,n)cout<<p[i]-1<<" \n"[i==n];
}

signed main()
{
	while(cin>>n>>m)work();
	return 0;
}#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 400005
#define inf 0x3f3f3f3f

int n,m;
vi e[maxn];
int p[maxn],vis[maxn],num[maxn],rnk[maxn];
vi buc[maxn];
set<int>st[maxn];

void make(){
	For(i,1,n)buc[0].pb(i);
	int id=0;
	For(i,1,n){
		int u=0;
		while(!u){
			while(buc[id].size()){
				if(!vis[buc[id].back()]){u=buc[id].back();break;}
				buc[id].pop_back();
			}
			if(!u)--id;
		}
		p[n-i+1]=u,vis[u]=1;
		for(int v:e[u])
			if(!vis[v])++num[v],id=max(id,num[v]),buc[num[v]].pb(v);
	}
	For(i,1,n)rnk[p[i]]=i;
}

int par[maxn];
void find(int u,int v,int w){
	queue<int>q;
	q.push(w);
	For(i,1,n)vis[i]=0;
	vis[w]=1; par[w]=0;
	while(q.size()){
		int x=q.front();q.pop();
		for(int y:e[x]){
			if(vis[y]||y==u||(y!=v&&st[u].count(y)))continue;
			vis[y]=1,q.push(y),par[y]=x;
		}
	}
	vi o={w,u};
	for(int x=v;x!=w;x=par[x])o.pb(x);
	cout<<o.size()<<'\n';
	for(auto x:o)cout<<x-1<<" ";cout<<"\n";
}

void work()
{
	if(!n&&!m)exit(0);
	For(i,0,n)buc[i].clear(),e[i].clear(),st[i].clear(),vis[i]=num[i]=0; 
	For(i,1,m){
		int u=read()+1,v=read()+1;
		e[u].pb(v),e[v].pb(u);
		st[u].insert(v),st[v].insert(u);
	}
	make();
	For(i,1,n)vis[i]=0;
	Rep(i,n,1){
		int u=p[i],mn=inf,pos;
		vi o;
		for(int v:e[u])
			if(rnk[v]>rnk[u]){
				o.pb(v);
				if(rnk[v]<mn)mn=rnk[v],pos=v;
			}
		// pos : latest (v)
		// x : w
		
		if(o.size()){
			for(int x:o)
				if(x!=pos&&!st[pos].count(x)){
					puts("NO");
					find(u,pos,x);
					return;
				}
		}
	}
	puts("YES");
	For(i,1,n)cout<<p[i]-1<<" \n"[i==n];
}

signed main()
{
	while(cin>>n>>m)work();
	return 0;
}*/

#include "Borislib.h"
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
vector<int> bfsB(vector<vector<int>> G){
    int N=G.size();
    vector<int> dis(N,-1);
    dis[0]=0;
    queue<int> que;
    que.push(0);
    while(!que.empty()){
        int v=que.front();
        que.pop();
        for(int nv:G[v]){
            if(dis[nv]!=-1) continue;
            dis[nv]=dis[v]+1;
            que.push(nv);
        }
    }
    return dis;
}
int NB;
vector<vector<int>> GB(550);
vector<int> disB;
vector<int> EB(550);
vector<int> par(550,-1);
void InitBoris(int N , int A[] , int B[]) {
  NB=N;
  rep(i,N) GB[A[i]].push_back(B[i]);
  rep(i,N) GB[B[i]].push_back(A[i]);
  disB=bfsB(GB);
  rep(i,N){
    if(disB[A[i]]>disB[B[i]]) EB[A[i]]=i,par[A[i]]=B[i];
    if(disB[B[i]]>disB[A[i]]) EB[B[i]]=i,par[B[i]]=A[i];
  }
}
int Boris(int city) {
  int N=NB;
  vector<int> cnt(12,0);
  rep(i,N) cnt[disB[i]%12]++;
  int min_val=550,id_val=-1;
  rep(i,12){
    if(min_val>cnt[i]){
      min_val=cnt[i];
      id_val=i;
    }
  }
  vector<vector<int>> D(N);
  int now=0;
  rep(i,N){
    if(i==0||disB[i]%12==id_val){
      rep(j,9){
        D[i].push_back(now);
        now++;
      }
    }else{
      D[i].push_back(now);
      now++;
    }
  }
  int ans=0;
  int v=city;
  while(1){
    if(v==0||disB[v]%12==id_val){
      int po=1;
      rep(j,9){
        ans+=Ask(D[v][j])*po;
        po*=2;
      }
      break;
    }else{
      ans+=Ask(D[v][0]);
      v=par[v];
    }
  }
  return ans;
}