#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
vector<int>G[1007];
int d[1007];
vector<int>res;
bool ok;
void dfs(int v,int o)
{
bool was=0;
d[v]=1;
for(auto u:G[v])
{
if(u==o) continue;
dfs(u,v);
d[v]=max(d[v],d[u]+1);
if(d[u]>2)
{
if(was) ok=0;
was=1;
}
}
}
void dfs1(int v,int o)
{
vector<int>V;
for(auto u:G[v])
{
if(u==o) continue;
if(d[u]>2) dfs1(u,v);
if(d[u]==2) V.pb(u);
}
res.pb(v);
for(auto x:V)
{
res.pb(x);
res.pb(v);
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,m,a,b;
cin>>n>>m;
if(m!=n-1)
{
cout<<"NO"<<endl;
return 0;
}
for(int i=0;i<n-1;i++)
{
cin>>a>>b;
G[a].pb(b);
G[b].pb(a);
}
vector<int>ans;
bool is=0;
for(int i=1;i<=n;i++)
{
ok=1;
res.clear();
dfs(i,0);
if(ok)
{
is=1;
dfs1(i,0);
res.pb(i);
if(sz(ans)==0||sz(res)<sz(ans)) ans=res;
}
}
if(!is) cout<<"NO"<<endl;
else
{
cout<<"YES"<<endl;
cout<<sz(ans)<<endl;
for(auto x:ans) cout<<x<<" ";
}
return 0;
}
